On cyclic MDS codes

We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co-)dimension 3, this question is related to permutation properties of the polynomial (xb - 1)/(x - 1) for a certain b. Using results on these polynomials we prove that over fields of odd characteristic the only MDS cyclic codes of dimension 3 are the Reed-Solomon codes. For codes of dimension O(pq) we prove the same result using techniques from algebraic geometry and finite geometry. Further, we exhibit a complete q-arc over the field Fq for even q. In the last section we discuss a connection between modular representations of the general linear group over Fq and the question of whether a given cyclic code is MDS


Published in:
Coding Theory and Cryptography: from Enigma and Geheimschreiber to Quantum Theory, 202-213
Year:
1999
Publisher:
Springer
Keywords:
Laboratories:




 Record created 2007-01-26, last modified 2018-03-17

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)