An enumeration of 1-perfect ternary codes

DOI10.1016/J.DISC.2023.113437MaRDI QIDQ6041863zbMATH OpenOpenAlexFDO

Authors Minjia Shi, Denis S. Krotov

Publication date 15 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2110.06305

zbMATH Keywords

switchingconcatenationperfect codesternary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

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.

Recommendations

• On perfect ternary constant weight codes
• Ranks of \(q\)-ary 1-perfect codes
• Publication:4488580
• On enumeration of nonequivalent perfect binary codes of length 15 and rank 15
• scientific article; zbMATH DE number 2148772

Cites work

• scientific article; zbMATH DE number 3831840 (Why is no real title available?)
• scientific article; zbMATH DE number 6004977 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 3555872 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1455120 (Why is no real title available?)
• scientific article; zbMATH DE number 1471084 (Why is no real title available?)
• scientific article; zbMATH DE number 3321827 (Why is no real title available?)
• A Combinatorial Construction of Perfect Codes
• A coding problem in steganography
• A new construction of group and nongroup perfect codes
• A new distance-regular graph of diameter 3 on 1024 vertices
• Additive perfect codes in Doob graphs
• Binary extended perfect codes of length 16 and rank 14
• Binary extended perfect codes of length 16 by the generalized concatenated construction
• Binary perfect codes of length 15 by the generalized concatenated construction
• Construction of perfect \(q\)-ary codes by switchings of simple components
• ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY
• Full Rank Tilings of Finite Abelian Groups
• Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
• Nonfull-rank factorizations of elementary 3-groups.
• On $Z_p Z_{p^k}$ -Additive Codes and Their Duality
• On Group and Nongroup Perfect Codes in $q$ Symbols.
• On Perfect Codes and Tilings: Problems and Solutions
• On linear and nonlinear single-error-correcting q-nary perfect codes
• On non-full-rank perfect codes over finite fields
• On perfect and Reed-Muller codes over finite fields
• On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• On the number of \(q\)-ary quasi-perfect codes with covering radius 2
• On the ranks and kernels problem for perfect codes
• On the structure of non-full-rank perfect \(q\)-ary codes
• Ranks of \(q\)-ary 1-perfect codes
• Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
• The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
• The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
• The classification of some perfect codes
• Tilings of Binary Spaces
• Une nouvelle famille de 3-codes parfaits sur GF(q)
• \(\mathbb {Z}_2\mathbb {Z}_4\)-additive perfect codes in steganography
• \(n\)-ary quasigroups of order 4.

Cited in

(3)

• Constructions and invariants of optimal codes in the Lee metric
• One construction of perfect ternary sequences
• Projective tilings and full-rank perfect codes

This page was built for publication: An enumeration of 1-perfect ternary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041863)