Every finite group is the automorphism group of some perfect code

DOI10.1016/0097-3165(86)90021-XzbMath0605.94008OpenAlexW2093292941MaRDI QIDQ1084374

Kevin T. Phelps

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90021-x

zbMATH Keywords

full automorphism groupperfect binary single error correcting code

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial codes (94B25)

Related Items (5)

On the symmetry group of the Mollard code ⋮ On the structure of symmetry groups of Vasil'ev codes ⋮ A note on the symmetry group of full rank perfect binary codes ⋮ On perfect binary codes ⋮ The group of permutation automorphisms of a \(q\)-ary Hamming code

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectrum of n quasigroups with given conjugate invariant subgroup
• On the groups of automorphisms of Steiner triple and quadruple systems
• A General Product Construction for Error Correcting Codes
• A Combinatorial Construction of Perfect Codes

This page was built for publication: Every finite group is the automorphism group of some perfect code