Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances

DOI10.1016/S0166-218X(00)00356-5zbMath1002.94536OpenAlexW2050626721MaRDI QIDQ5954078

Sergei V. Avgustinovich

Publication date: 30 January 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00356-5

zbMATH Keywords

isometrygraphsperfect binary codesperfect codesminimum distances

Mathematics Subject Classification ID

Other types of codes (94B60) Distance in graphs (05C12) Combinatorial codes (94B25)

Related Items (4)

On the minimum distance graph of an extended Preparata code ⋮ Transitive nonpropelinear perfect codes ⋮ Perfect codes as isomorphic spaces ⋮ On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\)

Cites Work

• On the extendability of code isometries

This page was built for publication: Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances