|
Problemy Peredachi Informatsii, 2003, Volume 39, Issue 4, Pages 30–34
(Mi ppi313)
|
|
|
|
This article is cited in 22 scientific papers (total 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.
Received: 20.01.2003
Citation:
S. V. Avgustinovich, F. I. Solov'eva, O. Heden, “On the Rank and Kernel Problem for Perfect Codes”, Probl. Peredachi Inf., 39:4 (2003), 30–34; Problems Inform. Transmission, 39:4 (2003), 341–345
Linking options:
https://www.mathnet.ru/eng/ppi313 https://www.mathnet.ru/eng/ppi/v39/i4/p30
|
Statistics & downloads: |
Abstract page: | 578 | Full-text PDF : | 127 | References: | 82 | First page: | 2 |
|