Families of nested completely regular codes and distance-regular graphs

DOI10.3934/amc.2015.9.233zbMath1361.94061arXiv1404.6358OpenAlexW2273669360MaRDI QIDQ2346713

Joaquim Borges, Josep Rifà, Victor A. Zinoviev

Publication date: 3 June 2015

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6358

zbMATH Keywords

distance-regular graphscompletely regular codesdistance-transitive graphscompletely transitive codes

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial codes (94B25)

Related Items (2)

On completely regular codes ⋮ Conway’s groupoid and its relatives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely regular codes and completely transitive codes
• Completely regular codes
• Distance regular covers of the complete graph
• Completely transitive codes in Hamming graphs
• New families of completely regular codes and their corresponding distance regular coset graphs
• Families of completely transitive codes and distance transitive graphs
• Antipodal covering graphs
• On Lifting Perfect Codes
• The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
• Antipodal distance-transitive covers of complete bipartite graphs

This page was built for publication: Families of nested completely regular codes and distance-regular graphs