A note on the symmetry group of full rank perfect binary codes
type: Item
instance of: scholarly article
title: A note on the symmetry group of full rank perfect binary codes
zbMATH Open document ID: 1268.94037
author: Olof Heden
published in: Discrete Mathematics
publication date: 2012-09-12T00:00:00Z
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6081343
zbMATH Keywords: perfect codes
MaRDI profile type: Publication
full work available at URL: j.disc.2012.06.009
OpenAlex ID: W2061197585
cites work: Perfect codes and the Mathieu groups
cites work: On the structure of symmetry groups of Vasil'ev codes
cites work: Perfect binary codes: constructions, properties, and enumeration
cites work: Q4472694
cites work: A survey of perfect codes
cites work: On the size of the symmetry group of a perfect code
cites work: On the structure of non-full-rank perfect \(q\)-ary codes
cites work: On the existence of extended perfect binary codes with trivial symmetry group
cites work: On the symmetry group of extended perfect binary codes of length \(n+1\) and rank \(n-\log(n+1)+2\)
cites work: Q3148511
cites work: Every finite group is the automorphism group of some perfect code
cites work: Q4488580
cites work: The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
cites work: On automorphism groups of perfect binary codes and Steiner triple systems
cites work: On the Nonexistence of Perfect Codes over Finite Fields
cites work: Q4081126
DOI: 10.1016/J.DISC.2012.06.009
review text: 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.
description: scientific article; zbMATH DE number 6081343