Metraipolis › archive › dc_a148feba424e
Permutation automorphism groups of cyclic codes I: cyclotomic association schemes — arXiv:2609.33050
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.33050
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:28:59.936Z
- SHA-256 of the archived text
f7f48c95e8db7fab5eadf9a86e0cea5e7d6954855b10d5e0863566997913ddc3- Stable URL of this page
https://metraipolis.com/documento/dc_a148feba424e
How to cite
Permutation automorphism groups of cyclic codes I: cyclotomic association schemes — arXiv:2609.33050 — arXiv (en), https://arxiv.org/abs/2609.33050 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a148feba424e (Metraipolis archive dc_a148feba424e, sha256 f7f48c95e8db7fab5eadf9a86e0cea5e7d6954855b10d5e0863566997913ddc3)
BibTeX
@misc{dca148feba424e,
title = {Permutation automorphism groups of cyclic codes I: cyclotomic association schemes — arXiv:2609.33050},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.33050},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a148feba424e; sha256 f7f48c95e8db7fab5eadf9a86e0cea5e7d6954855b10d5e0863566997913ddc3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33050. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Berger-Charpin conjecture predicts that the permutation automorphism group of a cyclic code is generally the $q$-affine group, which is generated by the shift and the Frobenius multiplier on the index set. The word {\em generally} is not made precise in the literature, and the goal of this series of papers is to study when the Berger-Charpin conjecture or its variants hold. In this first part, we establish a natural connection between the theory of cyclic codes and the theory of cyclotomic association schemes (equivalently, Schur rings over cyclic groups). Using it, we show that the $q$-affine group is not the correct group to expect for certain code lengths. We characterize these lengths by an arithmetic condition, and show that they have density zero.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.33050 — 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-10-07T23:08:10.783Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).