Metraipolis › archive › dc_02ee9d53e041
A density theorem for non-standard irreducible cyclic codes — arXiv:2611.00925
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00925
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:50:54.042Z
- SHA-256 of the archived text
f1a0cfd2c6479a19020ac2c5db3d67d0b47e2b6af13452f6be6548ab8d940fd4- Stable URL of this page
https://metraipolis.com/documento/dc_02ee9d53e041
How to cite
A density theorem for non-standard irreducible cyclic codes — arXiv:2611.00925 — arXiv (en), https://arxiv.org/abs/2611.00925 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_02ee9d53e041 (Metraipolis archive dc_02ee9d53e041, sha256 f1a0cfd2c6479a19020ac2c5db3d67d0b47e2b6af13452f6be6548ab8d940fd4)
BibTeX
@misc{dc02ee9d53e041,
title = {A density theorem for non-standard irreducible cyclic codes — arXiv:2611.00925},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00925},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_02ee9d53e041; sha256 f1a0cfd2c6479a19020ac2c5db3d67d0b47e2b6af13452f6be6548ab8d940fd4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00925. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove a fixed-characteristic density form of the Berger-Charpin conjecture for non-degenerate irreducible cyclic codes: for each prime $p$, the lengths admitting such a non-standard code over some finite field of characteristic $p$ have natural density zero. Thus, for almost every length coprime to $p$, every such code over every finite field of characteristic $p$ has only the permutation automorphisms generated by the cyclic shift and the Frobenius map. The proof uses the Feng--Hollmann--Li--Xiang classification for non-standard irreducible cyclic codes, a normal form for the deriving constructions in that paper, and a theorem by Wiertelak on multiplicative orders, in the form recalled by Moree. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.00925 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:15:38.124Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).