An enumeration of 1-perfect ternary codes

Abstract

We study codes with parameters of the ternary Hamming $(n=(3^m-1)/2,3^{n-m},3)$ code, i.e., ternary $1$-perfect codes. The rank of the code is defined to be the dimension of its affine span. We characterize ternary $1$-perfect codes of rank $n-m+1$, count their number, and prove that all such codes can be obtained from each other by a sequence of two-coordinate switchings. We enumerate ternary $1$-perfect codes of length $13$ obtained by concatenation from codes of lengths $9$ and $4$; we find that there are $93241327$ equivalence classes of such codes. Keywords: perfect codes, ternary codes, concatenation, switching.

References in corpus (10)

• On $Z_p{Z}_{p^k}$-additive codes and their duality
• The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
• The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties
• n-Ary quasigroups of order 4
• On the structure of non-full-rank perfect codes
• On the OA(1536,13,2,7) and related orthogonal arrays
• A new distance-regular graph of diameter 3 on 1024 vertices
• Additive perfect codes in Doob graphs
• On $q$-ary shortened-$1$-perfect-like codes
• Projective tilings and full-rank perfect codes

Cited by in corpus (1)

• Projective tilings and full-rank perfect codes