On the permutation groups of cyclic codes
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.
- A direct proof for the automorphism group of reed solomon codes
- Automorphism groups of cyclic codes
- Cyclic permutations in doubly-transitive groups
- Finite Permutation Groups and Finite Simple Groups
- Finite Primitive Linear Groups of Prime Degree
- scientific article; zbMATH DE number 3749242 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1227113 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3109449 (Why is no real title available?)
- Multipliers and generalized multipliers of cyclic objects and cyclic codes
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- On groups of odd prime-power degree that contain a full cycle
- Polynomial isomorphisms of combinatorial objects
- The Modular Permutation Representations of the Known Doubly Transitive Groups
- The permutation group of affine-invariant extended cyclic codes
- The Permutation Modules for GL(n +1, F q ) Acting on P n (F q
- Transitive permutation groups of prime-squared degree
- Codes from affine permutation groups
- Equidistant permutation group codes
- Automorphism groups of cyclic codes
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
- Groups of prime degree and the Bateman-Horn conjecture
- A transform approach to permutation groups of cyclic codes over Galois rings
- The automorphism group of double-error-correcting BCH codes
- On the equivalence of cyclic and quasi-cyclic codes over finite fields
- Groups of finite elementary codes
- On automorphism groups of binary cyclic codes
This page was built for publication: On the permutation groups of cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356726)