Irreducible cyclic MDS codes limited by length in composite cases
Length Bounds for Irreducible Cyclic MDS Codes
Information Theory
Summary
This paper studies certain special error-correcting codes called irreducible cyclic MDS codes and shows that their length is tightly limited when the length is a composite number. The authors use math properties involving groups and field extensions to set these limits and reduce the problem to a finite number of cases for small dimensions. They also confirm these restrictions hold more generally for all dimensions. However, the question remains open for codes with prime lengths. Their work clarifies when such codes of given length and dimension can or cannot exist.
What this means in practice
- •For error correction engineers: Identify impossible code length and dimension combinations for designing certain cyclic MDS error-correcting codes.
- •For systems cryptographers: Exclude certain composite-length cyclic codes when analyzing algebraic structures in cryptographic systems reliant on coding theory.
A theory result. No direct application yet.
Authors
Guanghui Zhang
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.