OpenAlex ·

Permutation automorphism groups of cyclic codes I: cyclotomic association schemes

Yanni Wu and Ziqing Xiang

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.33050
Original
Read it at the publisher
Topics
Combinatorics

Abstract

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.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Combinatorics

Get the few papers worth your time in Combinatorics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics