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 Edit this on Wikidata


Publication date: 15 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We study codes with parameters of the ternary Hamming (n=(3m1)/2,3nm,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 nm+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.


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




Recommendations




Cites Work


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)