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

DOI10.1016/S0166-218X(00)00356-5MaRDI QIDQ5954078zbMATH OpenOpenAlexFDO

Authors Sergey 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

graphsisometryminimum distancesperfect binary codesperfect codes

Mathematics Subject Classification ID

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

Cites work

• On the extendability of code isometries

Cited in

(8)

• On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\)
• Binary codes from reflexive uniform subset graphs on 3-sets
• Perfect codes as isomorphic spaces
• On the minimum distance graph of an extended Preparata code
• scientific article; zbMATH DE number 1285452 (Why is no real title available?)
• Extremal 1-codes in distance-regular graphs of diameter 3
• Transitive nonpropelinear perfect codes
• Optimum distance flag codes from spreads via perfect matchings in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954078)