On the existence of extended perfect binary codes with trivial symmetry group
Two binary codes are said to be equivalent if there is a permutation of the coordinates and permutations of the coordinate values that map the words of one of the codes onto those of the other. The permutations of the coordinate values can also be viewed via the addition of a binary word. A transformation of the described form that maps a code onto itself is called an automorphism of the code; all automorphisms form the automorphism group of the code. The question regarding existence of objects with trivial automorphism group is central in combinatorics. A perfect binary one-error-correcting code is always self-complementary (meaning that the complement of a codeword is always a codeword) and cannot therefore have a trivial automorphism group. Other similar questions may then be asked instead. For example, if one restricts the transformation to only permutations of the coordinates, one gets the definition of the symmetry group of a code, and one may ask about existence of perfect binary one-error-correcting codes with trivial symmetry group. The authors extend work by the first author [J. Comb. Math. Comb. Comput. 52, 109--115 (2005; Zbl 1073.94022)] and prove that for all \(n = 2^m-1\), \(m \geq 4\), and all \(r\) satisfying \(n-\log(n+1)+3 \leq r \leq n-1\), there are perfect binary one-error-correcting codes with length \(n\), rank \(r\), and trivial symmetry group. An analogous result holds for extended perfect codes. The all-zero vector is assumed to belong to the code when computing the rank, that is, the dimension of the space spanned by the codewords.
- On the symmetry group of extended perfect binary codes of length \(n+1\) and rank \(n-\log(n+1)+2\)
- scientific article; zbMATH DE number 2174615
- A note on the symmetry group of full rank perfect binary codes
- On the size of the symmetry group of a perfect code
- scientific article; zbMATH DE number 2154149
- scientific article; zbMATH DE number 1188976
- scientific article; zbMATH DE number 1811352
- On the action of the symmetric group on error-correcting codes
- On the structure of symmetry groups of Vasil'ev codes
- On the existence of self-dual permutation codes of finite groups
- Multiply transitivity of perfect 1-codes in symmetric groups
- Binary codes formed by functions with nontrivial inertia groups
- Coordinate transitivity of a class of extended perfect codes and their SQS
- On the size of the symmetry group of a perfect code
- On the symmetry group of the Mollard code
- Characterization of the automorphism group of quaternary linear Hadamard codes
- On separability of the classes of homogeneous and transitive perfect binary codes
- scientific article; zbMATH DE number 1811352 (Why is no real title available?)
- On the automorphism groups of the Z₂ Z₄-linear Hadamard codes and their classification
- A Family of Highly Symmetric Codes
- On the symmetry group of extended perfect binary codes of length \(n+1\) and rank \(n-\log(n+1)+2\)
- A note on the symmetry group of full rank perfect binary codes
- scientific article; zbMATH DE number 2154149 (Why is no real title available?)
- scientific article; zbMATH DE number 2174615 (Why is no real title available?)
- Linear maps of perfect codes and irregular \(C\)-partitions
- On binary linear codes whose automorphism group is trivial
- scientific article; zbMATH DE number 5588563 (Why is no real title available?)
- On extremely transitive extended perfect codes
- 1-perfect uniform and distance invariant partitions
This page was built for publication: On the existence of extended perfect binary codes with trivial symmetry group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268258)
