S. V. Avgustinovich, “On the structure of minimal distance graphs of perfect binary <nobr>$(n,3)$</nobr>-codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 1998, Volume 5, Issue 4,Pages <nobr>3

JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., Ser. 1, 1998 Volume 5, Issue 4, Pages 3–5 (Mi da365)

This article is cited in 6 papers

On the structure of minimal distance graphs of perfect binary $(n,3)$-codes

S. V. Avgustinovich

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

UDC: 519.72

Received: 01.06.1998

Bibliographic databases: