|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 1998, Volume 5, Issue 4, Pages 3–5
(Mi da365)
|
|
|
|
This article is cited in 6 scientific papers (total 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
Received: 01.06.1998
Citation:
S. V. Avgustinovich, “On the structure of minimal distance graphs of perfect binary $(n,3)$-codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998), 3–5
Linking options:
https://www.mathnet.ru/eng/da365 https://www.mathnet.ru/eng/da/v5/s1/i4/p3
|
Statistics & downloads: |
Abstract page: | 289 | Full-text PDF : | 87 |
|