2000 character limit reached
On extended perfect codes (2403.10992v1)
Published 16 Mar 2024 in math.CO, cs.IT, and math.IT
Abstract: We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2m$, $m\geq 1$. Recently, Bespalov proved nonexistence of extended $1$-perfect codes for $q=3$, $4$, $n>q+2$. In this work, we characterize all positive integers $n$, $r$ and prime $p$, for which there exist such a code in $H(n,pr)$.
- S. Ball. On sets of vectors of a finite vector space in which every subset of basis size is a basis. J. Eur. Math. Soc., 14(3):733–748, 2012. DOI: 10.4171/JEMS/316.
- Evgeny Bespalov. On the non-existence of extended 1-perfect codes and mds codes. Journal of Combinatorial Theory, Series A, 189:105607, 2022.
- On completely regular codes. Probl. Inf. Transm., 55(1):1–45, Jan. 2019. DOI: 10.1134/S0032946019010010.
- Rook domains, latin squares, and error-distributing codes. IEEE Trans. Inf. Theory, 10(3):196–208, 1964. DOI: 10.1109/TIT.1964.1053680.
- O. Heden and C. Roos. The non-existence of some perfect codes over non-prime power alphabets. Discrete Math., 311(14):1344–1348, 2011. DOI: 10.1016/j.disc.2011.03.024.
- On the classification of MDS codes. IEEE Trans. Inf. Theory, 61(12):6485–6492, December 2015. DOI: 10.1109/TIT.2015.2488659.
- D. S. Krotov. On weight distributions of perfect colorings and completely regular codes. Des. Codes Cryptography, 61(3):315–329, 2011. DOI: 10.1007/s10623-010-9479-4.
- The Theory of Error-Correcting Codes. Amsterdam, Netherlands: North Holland, 1977.
- W. J. Martin. Completely Regular Subsets. PhD thesis, University of Waterloo, Waterloo, Ontario, Canada, 1992. Online: http://users.wpi.edu/~martin/RESEARCH/THESIS/.