On the Automorphism Groups and Equivalence of Cyclic Combinatorial Objects

2012/07/13 by Kenza Guenda, Guenda, Kenza, T. Aaron Gulliver +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1207.3132

arxiv created 2012/07/13 · arxiv updated 2012/07/16

Abstract

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial objects on p^m elements are equivalent.

Related

• Automorphism groups of cyclic codes
• The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes
• On automorphism groups of binary cyclic codes
• Graphical Cyclic Permutation Groups
• Automorphism groups of some AG codes