Berger–Charpin conjecture
Let be prime, let with , and let be a non-degenerate irreducible cyclic code with . Write for its permutation automorphism group, let be the cyclic shift, and let be the Frobenius permutation. The Berger–Charpin conjecture asserts that every such code is standard, meaning that , apart from explicitly structured exceptional families of non-standard irreducible cyclic codes.
References
- A density theorem for non-standard irreducible cyclic codes — arXiv — Tao Feng, Henk D. L. Hollmann, Weicong Li, Qing Xiang
Source: arXiv
Progress summary
A 2026 paper reports that exceptions become vanishingly rare in each fixed characteristic, but this does not settle every exceptional length or the full conjecture.
The Berger–Charpin conjecture concerns whether irreducible cyclic codes are standard apart from explicitly structured exceptions. Feng, Hollmann, Li, and Xiang classified the known non-standard families and presented this as strong evidence, rather than a complete proof.
Known results
- Under , Feng, Hollmann, Li, and Xiang (March 3, 2026) classified all non-standard non-degenerate irreducible cyclic codes into explicit exceptional families and specified constructions.
October 31, 2026 density claim
Feng, Hollmann, Li, and Xiang report that, for every prime , the lengths admitting a non-standard irreducible cyclic code over some field of characteristic have natural density zero. This is an asymptotic advance, not a classification of individual exceptional lengths, and the retrieved evidence does not independently verify the claim.
Current status (as of November 2026): The full Berger–Charpin conjecture remains open; a density-zero theorem for exceptional lengths has been claimed but is unverified.
Solutions 0
No solutions have been posted yet.