Length Bounds for Irreducible Cyclic MDS Codes
Abstract
We prove the MDS length bound for nontrivial irreducible cyclic codes of every composite length. The classical trace realization turns the MDS property into independence of elements of a multiplicative subgroup. Every nonidentity subgroup must have the full extension degree. This restriction yields length congruences, and the Frobenius-orbit description of the coefficient field gives an exact descent obstruction. A cyclotomic argument reduces each fixed dimension to finitely many parameters. For dimensions at most thirty, established geometric bounds reduce the alphabet to a small finite range; the remaining twelve parameter triples are excluded by explicit products of at most three determinant factors and a low-degree multiplier argument. An independent argument proves the composite-length theorem in arbitrary dimension. The standardness conclusion is stated separately as a conditional consequence of the classification statement of Feng, Hollmann, Li, and Xiang; the correct extension-field reduction retains a semilinear quotient. The general prime-length problem is not settled here. Neither length proof uses the automorphism classification or the recent odd-characteristic range announced by Fan.
Related
- The weight enumerators of irreducible cyclic codes of length 2ℓ
- A density theorem for non-standard irreducible cyclic codes
- The spectral relation between irreducible cyclic codes and generalized Paley graphs
- On the maximum length of cyclic MDS codes
- Cyclic Codes of Length 7_p^s over F_p^m + uF_p^m : Characterization, Duals, and Applications to Quantum and LCD Codes
BibTeX
@misc{zhang2026length,
title = {{Length Bounds for Irreducible Cyclic MDS Codes}},
author = {Guanghui Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.28047},
eprint = {2610.28047},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.28047},
}
RIS
TY - UNPB
TI - Length Bounds for Irreducible Cyclic MDS Codes
AU - Guanghui Zhang
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.28047
UR - https://arxiv.org/abs/2610.28047
AB - We prove the MDS length bound for nontrivial irreducible cyclic codes of every composite length. The classical trace realization turns the MDS property into independence of elements of a multiplicative subgroup. Every nonidentity subgroup must have the full extension degree. This restriction yields length congruences, and the Frobenius-orbit description of the coefficient field gives an exact descent obstruction. A cyclotomic argument reduces each fixed dimension to finitely many parameters. For dimensions at most thirty, established geometric bounds reduce the alphabet to a small finite range; the remaining twelve parameter triples are excluded by explicit products of at most three determinant factors and a low-degree multiplier argument. An independent argument proves the composite-length theorem in arbitrary dimension. The standardness conclusion is stated separately as a conditional consequence of the classification statement of Feng, Hollmann, Li, and Xiang; the correct extension-field reduction retains a semilinear quotient. The general prime-length problem is not settled here. Neither length proof uses the automorphism classification or the recent odd-characteristic range announced by Fan.
ER -