Rolf Bienert, Benjamin Klopsch
Published 2008-10-19, updated 2009-03-23Version 2
In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated wreath products of several symmetric groups. Interestingly, some of the codes we consider also arise in the context of regular lattice graphs and permutation decoding.
Comments: 19 pages, minor orthographical and grammatical corrections
Automorphism groups of designs with $λ=1$
On automorphism groups of binary cyclic codes
Automorphism groups of circulant graphs -- a survey
![QR code for arXiv:0810.3440 [math.CO]](http://oss.arxitics.com/images/favicon.svg)