Codes in Bipartite Distance-Regular Graphs

DOI10.1112/JLMS/S2-16.2.197MaRDI QIDQ4140853zbMATH OpenOpenAlexFDO

Authors Eiichi Bannai

Publication date 1977

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-16.2.197

Mathematics Subject Classification ID

Graph theory (05C99) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(9)

• On the non-existence of perfect and nearly perfect codes
• Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs
• On subgroup perfect codes in Cayley graphs
• 1-perfect codes in Sierpiński graphs
• On completely regular codes
• Subgroup perfect codes in Lie type simple groups of rank one
• Subgroup perfect codes of 2-groups with cyclic maximal subgroups
• Subgroup perfect codes of simple N-groups
• Optimal tristance anticodes in certain graphs

This page was built for publication: Codes in Bipartite Distance-Regular Graphs

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