On the permutation groups of cyclic codes
From MaRDI portal
Abstract: We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two cyclic codes of length p^r can be equivalent. We also find the set of permutations by which two quasi-cyclic codes can be equivalent.
Recommendations
Cites work
- 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?)
- 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
- 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 Modules for GL(n +1, F q ) Acting on P n (F q ) and Fqn+1
- The permutation group of affine-invariant extended cyclic codes
- Transitive permutation groups of prime-squared degree
Cited in
(9)- A transform approach to permutation groups of cyclic codes over Galois rings
- Groups of prime degree and the Bateman-Horn conjecture
- Equidistant permutation group codes
- On the equivalence of cyclic and quasi-cyclic codes over finite fields
- Codes from affine permutation groups
- Groups of finite elementary codes
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
- The automorphism group of double-error-correcting BCH codes
- Automorphism groups of 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)