Title of article
Perfect binary (n,3) codes: the structure of graphs of minimum distances Original Research Article
Author/Authors
S.V. Avgustinovich، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
3
From page
9
To page
11
Abstract
We prove that the graphs of minimum distances of two perfect binary (n,3) codes are isomorphic if and only if these codes are equivalent.
Keywords
Code , Perfect codes , Distance , isometry , Graph
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885288
Link To Document