|
Problemy Peredachi Informatsii, 2016, Volume 52, Issue 3, Pages 92–96
(Mi ppi2214)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Coding Theory
On perfect codes that do not contain Preparata-like codes
D. S. Krotov, A. Yu. Vasil'eva Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Abstract:
We show that for every length of the form $4^k-1$ there exists a binary $1$-perfect code that does not contain any Preparata-like code.
Received: 30.12.2015 Revised: 10.03.2016
Citation:
D. S. Krotov, A. Yu. Vasil'eva, “On perfect codes that do not contain Preparata-like codes”, Probl. Peredachi Inf., 52:3 (2016), 92–96; Problems Inform. Transmission, 52:3 (2016), 284–288
Linking options:
https://www.mathnet.ru/eng/ppi2214 https://www.mathnet.ru/eng/ppi/v52/i3/p92
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 50 | References: | 37 | First page: | 9 |
|