The Weights in MDS Codes
Information Theory
2011-03-31 v2 math.IT
Abstract
The weights in MDS codes of length n and dimension k over the finite field GF(q) are studied. Up to some explicit exceptional cases, the MDS codes with parameters given by the MDS conjecture are shown to contain all k weights in the range n-k+1 to n. The proof uses the covering radius of the dual code
Cite
@article{arxiv.0908.1669,
title = {The Weights in MDS Codes},
author = {Martianus Frederic Ezerman and Markus Grassl and Patrick Sole},
journal= {arXiv preprint arXiv:0908.1669},
year = {2011}
}
Comments
5 pages, submitted to IEEE Trans. IT. This version 2 is the revised version after the refereeing process. Accepted for publication