Geodesic
On the structure of minimal distance graphs of perfect binary $(n,3)$-codes
Diskretnyj analiz i issledovanie operacij, Tome 5 (1998) no. 4, pp. 3-5.

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

@article{DA_1998_5_4_a0,
     author = {S. V. Avgustinovich},
     title = {On the structure of minimal distance graphs of perfect binary $(n,3)$-codes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--5},
     publisher = {mathdoc},
     volume = {5},
     number = {4},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1998_5_4_a0/}
}
TY  - JOUR
AU  - S. V. Avgustinovich
TI  - On the structure of minimal distance graphs of perfect binary $(n,3)$-codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1998
SP  - 3
EP  - 5
VL  - 5
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1998_5_4_a0/
LA  - ru
ID  - DA_1998_5_4_a0
ER  - 
%0 Journal Article
%A S. V. Avgustinovich
%T On the structure of minimal distance graphs of perfect binary $(n,3)$-codes
%J Diskretnyj analiz i issledovanie operacij
%D 1998
%P 3-5
%V 5
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1998_5_4_a0/
%G ru
%F DA_1998_5_4_a0
S. V. Avgustinovich. On the structure of minimal distance graphs of perfect binary $(n,3)$-codes. Diskretnyj analiz i issledovanie operacij, Tome 5 (1998) no. 4, pp. 3-5. http://geodesic.mathdoc.fr/item/DA_1998_5_4_a0/