arXiv (All)
open access
Permutation automorphism groups of cyclic codes I: cyclotomic association schemes
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 serie
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The fields generated by character values of linear and unitary groups#1129780
- Projector additive group codes#821838
- Length-generating functions for twisted involutions of Coxeter groups#985401
- Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes#644394
- Enumeration of certain permutation group polynomials#784875
Record · ID 1117762
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive