On the permutation groups of cyclic codes (Q356726): Difference between revisions

The authors generalize the results of [\textit{R. Bienert} and \textit{B. Klopsch}, J. Algebr. Comb. 31, No. 1, 33--52 (2010; Zbl 1195.94083)] and classify the permutation groups of the non-elementary cyclic codes (the elementary codes have permutation group \(S_n\)) over arbitrary finite fields. If the length \(n=p\) is a prime then these groups are either subgroups of \(\mathrm{AGL}(1,p)\) or equal to \(\mathrm{PSL}(2,11)\), \(M_{23}\) or certain groups \(\mathrm{P}\Gamma \mathrm{L}(d,q)\) (\(d\geq 3\) prime) in defining characteristic. Similar results hold for codes of composite or prime power length.