A note on the symmetry group of full rank perfect binary codes
A perfect 1-error-correcting binary code is, for short, called a perfect code. The rank of a perfect code \(C\), \(\text{rank}(C)\), is the dimension of the linear span \(\langle C\rangle\) of the words of \(C\). It was proved by \textit{T. Etzion} and \textit{A. Vardy} [IEEE Trans. Inf. Theory 40, No. 3, 754--763 (1994; Zbl 0824.94029)] that for every length \(n= 2^m- 1\), where \(m\geq 4\), and every integer \(r\) in the interval \(n- \log(n+ 1)\leq r\leq n\) there exist perfect codes of rank \(r\) and length \(n\). A perfect code \(C\) has full rank if \(\text{rank}(C)= n\).NEWLINENEWLINE In this paper the author proves the following upper bound for the size of the symmetry groups of full rank perfect codes: For every full rank perfect code \(C\) of length \(n= 2^m-1\) with \(m\geq 4\), NEWLINE\[NEWLINE|\text{Sym}(C)|\leq{2\over n+1}|\text{GL}(\log(n+ 1),2)|,NEWLINE\]NEWLINE where \(\text{GL}(\log(n+ 1),2)\) means the general linear group. This upper bound is better than all previously known upper bounds.
- scientific article; zbMATH DE number 2174615
- On the symmetry group of extended perfect binary codes of length \(n+1\) and rank \(n-\log(n+1)+2\)
- On the size of the symmetry group of a perfect code
- On the existence of extended perfect binary codes with trivial symmetry group
- scientific article; zbMATH DE number 1811352
- A survey of perfect codes
- Every finite group is the automorphism group of some perfect code
- scientific article; zbMATH DE number 1811352 (Why is no real title available?)
- scientific article; zbMATH DE number 3499625 (Why is no real title available?)
- scientific article; zbMATH DE number 2077652 (Why is no real title available?)
- scientific article; zbMATH DE number 1471084 (Why is no real title available?)
- On automorphism groups of perfect binary codes and Steiner triple systems
- On the existence of extended perfect binary codes with trivial symmetry group
- On the Nonexistence of Perfect Codes over Finite Fields
- On the size of the symmetry group of a perfect code
- On the structure of non-full-rank perfect \(q\)-ary codes
- On the structure of symmetry groups of Vasil'ev codes
- On the symmetry group of extended perfect binary codes of length \(n+1\) and rank \(n-\log(n+1)+2\)
- Perfect binary codes: constructions, properties, and enumeration
- Perfect codes and the Mathieu groups
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
- On the existence of extended perfect binary codes with trivial symmetry group
- On the size of the symmetry group of a perfect code
- On the symmetry group of the Mollard code
- On the structure of symmetry groups of Vasil'ev codes
- A remark on full rank perfect codes
- 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 (Why is no real title available?)
This page was built for publication: A note on the symmetry group of full rank perfect binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449148)
