RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2003 Volume 39, Issue 4, Pages 30–34 (Mi ppi313)
This article is cited in 22 papers

Information Theory and Coding Theory

On the Rank and Kernel Problem for Perfect Codes

S. V. Avgustinovicha, F. I. Solov'evaa, O. Hedenb

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Royal Institute of Technology

Abstract: A construction is proposed which, for $n$ large enough, allows one to build perfect binary codes of length $n$ and rank $r$, with kernel of dimension $k$, for any admissible pair $(r,k)$ within the limits of known bounds.

UDC: 621.391.15

Received: 20.01.2003


 English version: Problems of Information Transmission, 2003, 39:4, 341–345

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025