Probl. Peredachi Inf., 1996 Volume 32, Issue 3, Pages 47–50
(Mi ppi344)
|
This article is cited in
25 papers
Coding Theory
On the Nonsystematic Perfect Binary Codes
S. V. Avgustinovich,
F. I. Solov'eva
Abstract:
The existence of nonsystematic perfect binary codes of length
$n$ is proved for every
$n=2^k-1$,
$k\geq 8$.
UDC:
621.391.15:519.725
Received: 01.08.1995
Revised: 03.01.1996
English version:
Problems of Information Transmission, 1996,
32:3,
258–261
Bibliographic databases:
© , 2025
Fulltext:
PDF file (497 kB)