On the permutation groups of cyclic codes
From MaRDI portal
Publication:356726
DOI10.1007/S10801-012-0399-4zbMATH Open1273.94405arXiv1002.2456OpenAlexW1980470481MaRDI QIDQ356726FDOQ356726
Authors: Kenza Guenda, T. Aaron Gulliver
Publication date: 26 July 2013
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1002.2456
Recommendations
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Cyclic codes (94B15)
Cites Work
- Title not available (Why is that?)
- Cyclic permutations in doubly-transitive groups
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transitive permutation groups of prime-squared degree
- Finite Permutation Groups and Finite Simple Groups
- Title not available (Why is that?)
- The Permutation Modules for GL(n +1, F q ) Acting on P n (F q ) and Fqn+1
- Polynomial isomorphisms of combinatorial objects
- Multipliers and generalized multipliers of cyclic objects and cyclic codes
- Automorphism groups of cyclic codes
- On groups of odd prime-power degree that contain a full cycle
- The Modular Permutation Representations of the Known Doubly Transitive Groups
- Title not available (Why is that?)
- Finite Primitive Linear Groups of Prime Degree
- The permutation group of affine-invariant extended cyclic codes
- A direct proof for the automorphism group of reed solomon codes
Cited In (9)
- Groups of finite elementary codes
- Codes from affine permutation groups
- Automorphism groups of cyclic codes
- On the equivalence of cyclic and quasi-cyclic codes over finite fields
- The automorphism group of double-error-correcting BCH codes
- Equidistant permutation group codes
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
- A transform approach to permutation groups of cyclic codes over Galois rings
- Groups of prime degree and the Bateman-Horn conjecture
Uses Software
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)