Computer Science – Information Theory
Scientific paper
2009-08-12
IEEE Transactions on Information Theory, vol. 57, no. 1, January 2011, pp. 392-396
Computer Science
Information Theory
5 pages, submitted to IEEE Trans. IT. This version 2 is the revised version after the refereeing process. Accepted for publica
Scientific paper
10.1109/TIT.2010.2090246
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
Ezerman Martianus Frederic
Grassl Markus
Sole Patrick
No associations
LandOfFree
The Weights in MDS Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Weights in MDS Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Weights in MDS Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-370351