An enumeration of 1-perfect ternary codes
From MaRDI portal
Publication:6041863
DOI10.1016/J.DISC.2023.113437zbMATH Open1519.94239arXiv2110.06305OpenAlexW4362635821MaRDI QIDQ6041863FDOQ6041863
Authors: Minjia Shi, Denis S. Krotov
Publication date: 15 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: We study codes with parameters of the ternary Hamming code, i.e., ternary -perfect codes. The rank of the code is defined to be the dimension of its affine span. We characterize ternary -perfect codes of rank , 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 -perfect codes of length obtained by concatenation from codes of lengths and ; we find that there are equivalence classes of such codes. Keywords: perfect codes, ternary codes, concatenation, switching.
Full work available at URL: https://arxiv.org/abs/2110.06305
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(n\)-ary quasigroups of order 4.
- The classification of some perfect codes
- Title not available (Why is that?)
- On Perfect Codes and Tilings: Problems and Solutions
- On perfect and Reed-Muller codes over finite fields
- Construction of perfect \(q\)-ary codes by switchings of simple components
- Ranks of \(q\)-ary 1-perfect codes
- On the structure of non-full-rank perfect \(q\)-ary codes
- Binary perfect codes of length 15 by the generalized concatenated construction
- A Combinatorial Construction of Perfect Codes
- Binary extended perfect codes of length 16 and rank 14
- Title not available (Why is that?)
- On linear and nonlinear single-error-correcting q-nary perfect codes
- Title not available (Why is that?)
- Tilings of Binary Spaces
- Binary extended perfect codes of length 16 by the generalized concatenated construction
- \(\mathbb {Z}_2\mathbb {Z}_4\)-additive perfect codes in steganography
- Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
- ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY
- Full Rank Tilings of Finite Abelian Groups
- A new construction of group and nongroup perfect codes
- On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
- Une nouvelle famille de 3-codes parfaits sur GF(q)
- On $Z_p Z_{p^k}$ -Additive Codes and Their Duality
- On the ranks and kernels problem for perfect codes
- Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist
- A coding problem in steganography
- Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
- On Group and Nongroup Perfect Codes in $q$ Symbols.
- Nonfull-rank factorizations of elementary 3-groups.
- Additive perfect codes in Doob graphs
- On non-full-rank perfect codes over finite fields
- A new distance-regular graph of diameter 3 on 1024 vertices
- On the number of \(q\)-ary quasi-perfect codes with covering radius 2
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- Title not available (Why is that?)
Cited In (3)
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)