On the non-existence of perfect and nearly perfect codes

DOI10.1016/0012-365X(82)90045-0zbMath0493.05059MaRDI QIDQ1168341

Peter Hammond

Publication date: 1982

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

zbMATH Keywords

distance-regular graphscompletely regular codes

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial codes (94B25)

Related Items (3)

1-perfect codes in Sierpiński graphs ⋮ A note on the existence of perfect constant weight codes ⋮ On completely regular codes

Cites Work

• Unnamed Item
• Unnamed Item
• Nearly perfect codes in distance-regular graphs
• Codes in Bipartite Distance-Regular Graphs
• A new 5‐arc‐transitive cubic graph

This page was built for publication: On the non-existence of perfect and nearly perfect codes