Automorphism groups of cyclic codes
Combinatorics
2009-03-23 v2 Group Theory
Abstract
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.
Cite
@article{arxiv.0810.3440,
title = {Automorphism groups of cyclic codes},
author = {Rolf Bienert and Benjamin Klopsch},
journal= {arXiv preprint arXiv:0810.3440},
year = {2009}
}
Comments
19 pages, minor orthographical and grammatical corrections