Geodesic
On a~lower bound for the number of perfect binary codes
Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 4, pp. 44-48.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_1999_6_4_a3,
     author = {S. A. Malyugin},
     title = {On a~lower bound for the number of perfect binary codes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {44--48},
     publisher = {mathdoc},
     volume = {6},
     number = {4},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1999_6_4_a3/}
}
TY  - JOUR
AU  - S. A. Malyugin
TI  - On a~lower bound for the number of perfect binary codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1999
SP  - 44
EP  - 48
VL  - 6
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1999_6_4_a3/
LA  - ru
ID  - DA_1999_6_4_a3
ER  - 
%0 Journal Article
%A S. A. Malyugin
%T On a~lower bound for the number of perfect binary codes
%J Diskretnyj analiz i issledovanie operacij
%D 1999
%P 44-48
%V 6
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1999_6_4_a3/
%G ru
%F DA_1999_6_4_a3
S. A. Malyugin. On a~lower bound for the number of perfect binary codes. Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 4, pp. 44-48. http://geodesic.mathdoc.fr/item/DA_1999_6_4_a3/