Nearly perfect codes in distance-regular graphs

DOI10.1016/0012-365X(76)90004-2zbMath0339.94004MaRDI QIDQ1231470

Peter Hammond

Publication date: 1976

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

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items

On the non-existence of perfect and nearly perfect codes, An improved version of Lloyd's theorem

Cites Work

• Unnamed Item
• Perfect codes in the graphs \(O_k\)
• Nearly perfect binary codes
• Perfect codes in graphs
• Antipodal covering graphs
• A class of optimum nonlinear double-error-correcting codes
• PRIMITIVE AND IMPRIMITIVE GRAPHS
• A new 5‐arc‐transitive cubic graph