scientific article; zbMATH DE number 2154149
From MaRDI portal
Publication:4664704
It is proven that the order of the automorphism group of a perfect binary code of length \(n\) is not greater than the order of the automorphism group of the Hamming code of the same length. Upper bounds are also derived on the order of the automorphism group of an extended perfect binary code and a Steiner system \(S(t,t+1,n)\). For the entire collection see [Zbl 0944.00096].
Recommendations
Cited in
(13)- Every finite group is the automorphism group of some perfect code
- Automorphism groups of BWD-codes
- On perfect t-shift codes in abelian groups
- On the automorphism groups of affine-invariant codes
- On the existence of extended perfect binary codes with trivial symmetry group
- The group of permutation automorphisms of a q-ary Hamming code
- scientific article; zbMATH DE number 1811352 (Why is no real title available?)
- scientific article; zbMATH DE number 1811358 (Why is no real title available?)
- ON THE AUTOMORPHISM GROUPS OF A FAMILY OF BINARY QUANTUM ERROR-CORRECTING CODES
- Codes From Symmetry Groups, and a $[32, 17, 8]$ Code
- On the symmetry group of extended perfect binary codes of length \(n+1\) and rank \(n-\log(n+1)+2\)
- On the automorphism groups of the \(\mathbb Z_2\mathbb Z_4\)-linear 1-perfect and Preparata-like codes
- On automorphism groups of perfect binary codes and Steiner triple systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664704)