|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 3, Pages 15–21
(Mi ppi374)
|
|
|
|
This article is cited in 35 scientific papers (total in 35 papers)
Information Theory and Coding Theory
Construction of Perfect Binary Codes by Sequential Shifts of $\tilde\alpha$-Components
S. V. Avgustinovich, F. I. Solov'eva
Abstract:
We propose the construction of perfect binary codes by sequential shifts of special-kind components of the Hamming code. The construction yields a new lower estimate on the number of nonequivalent perfect binary codes. Some known constructions of perfect binary codes are particular cases of this one.
Received: 31.05.1996 Revised: 15.04.1997
Citation:
S. V. Avgustinovich, F. I. Solov'eva, “Construction of Perfect Binary Codes by Sequential Shifts of $\tilde\alpha$-Components”, Probl. Peredachi Inf., 33:3 (1997), 15–21; Problems Inform. Transmission, 33:3 (1997), 202–207
Linking options:
https://www.mathnet.ru/eng/ppi374 https://www.mathnet.ru/eng/ppi/v33/i3/p15
|
Statistics & downloads: |
Abstract page: | 640 | Full-text PDF : | 179 | First page: | 2 |
|