The order bound on generalized Hamming weights is introduced in a general setting of codes on varieties which comprises both the geometric Goppa codes as the q-ary Reed-Muller codes. It is shown that this bound is sharp for the latter.
|Title of host publication||Proceedings 1997 IEEE International Symposium on Information Theory (ISIT 1997, Ulm, Germany, June 29-July 4, 1997)|
|Publisher||Institute of Electrical and Electronics Engineers|
|Number of pages||1|
|Publication status||Published - 1997|