RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
1999
Volume 6,
Issue 4,
Pages
44–48
(Mi da327)
This article is cited in
6
papers
On a lower bound for the number of perfect binary codes
S. A. Malyugin
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
UDC:
519.72
Received:
03.08.1999
Fulltext:
PDF file (472 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025
Fulltext:
PDF file (472 kB)