|
|
Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 2, Pages 84–91
(Mi da684)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
On the admissible families of components of Hamming codes
A. M. Romanov S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
Abstract:
We describe the properties of the $i$-components of Hamming codes. We suggest constructions of the admissible families of components of Hamming codes. It is shown that every $q$-ary code of length $m$ and minimum distance 5 (for $q=3$ the minimum distance is 3) can be embedded in a $q$-ary 1-perfect code of length $n=(q^m-1)/(q-1)$. It is also demonstrated that every binary code of length $m+k$ and minimum distance $3k+3$ can be embedded in a binary 1-perfect code of length $n=2^m-1$. Bibliogr. 5.
Keywords:
Hamming code, 1-perfect code, $q$-ary code, binary code, $i$-component.
Received: 13.05.2011 Revised: 21.11.2011
Citation:
A. M. Romanov, “On the admissible families of components of Hamming codes”, Diskretn. Anal. Issled. Oper., 19:2 (2012), 84–91; J. Appl. Industr. Math., 6:3 (2012), 355–359
Linking options:
https://www.mathnet.ru/eng/da684 https://www.mathnet.ru/eng/da/v19/i2/p84
|
|