RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2016 Volume 52, Issue 3, Pages 92–96 (Mi ppi2214)
This article is cited 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.

UDC: 621.391.15

Received: 30.12.2015
Revised: 10.03.2016


 English version: Problems of Information Transmission, 2016, 52:3, 284–288

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024