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
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
Journal title :
Discrete Applied Mathematics
