Codes in Bipartite Distance-Regular Graphs

DOI10.1112/jlms/s2-16.2.197zbMath0365.94015OpenAlexW1994594852MaRDI QIDQ4140853

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)

Related Items (6)

1-perfect codes in Sierpiński graphs ⋮ On completely regular codes ⋮ On the non-existence of perfect and nearly perfect codes ⋮ On subgroup perfect codes in Cayley graphs ⋮ Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs ⋮ Optimal tristance anticodes in certain graphs

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