Automorphism groups of cyclic codes

Simple item page
dc.creatorBienert, Rolf
dc.creatorKlopsch, Benjamin
dc.date2008-10-19
dc.date2009-03-23
dc.date.accessioned2026-07-07T12:54:38Z
dc.date.available2026-07-07T12:54:38Z
dc.descriptionIn 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.
dc.description19 pages, minor orthographical and grammatical corrections
dc.identifierhttps://arxiv.org/abs/0810.3440
dc.identifierhttp://arxiv.org/abs/0810.3440
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224005
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject05E20; 94B15; 94B05
dc.titleAutomorphism groups of cyclic codes
dc.typetext

Files

Collections

arXiv