Permutation automorphism groups of cyclic codes I: cyclotomic association schemes
Yanni Wu, Ziqing Xiang
Source abstract
The Berger-Charpin conjecture predicts that the permutation automorphism group of a cyclic code is generally the -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 -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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.