An enumeration of 1-perfect ternary codes (Q6041863): Difference between revisions

The rank of a code is defined to be the dimension of its affine span. This work studies codes with parameters of the ternary Hamming \((n = (3^m-1)/2, 3n-m, 3)\) code, i.e., ternary 1-perfect codes. We say that a 1-perfect code is of rank \(+r\) if its rank is \(r\) greater than the dimension of the Hamming code of the same parameters. A characterization of ternary 1-perfect codes of rank \(n-m+1\) is shown, and its proved that all such codes can be obtained from each other by a sequence of two coordinate switchings. The structure of a 3-ary 1-perfect code \(C\) with kernel size \(|C|/3\) is also considered. A computer-aided enumerations of: the concatenated 3-ary 1-perfect codes of length 13; all auxiliary objects including the partitions of the space into 3-ary 1-perfect codes of length 4 and partitions of a \((9, 38, 2)_3\) MDS code into \((9, 36, 3)_3\) subcodes; are performed. Enumerating the last partitions is of independent interest because \((n=q^m,q^{n-m-1},q)_q\) subcodes of an \((n, q^n-1, 2)_q\) MDS code form an interesting class of completely regular codes, which share with perfect codes some properties and constructing tools. The obtained partitions can further be used for constructing 1-perfect codes of any admissible length larger than 13 by generalized concatenated construction. The paper provides also a database containing representatives of the equivalence classes of the classified objects.