Arithmetic completely regular codes

MaRDI QIDQ2808536zbMATH OpenFDO

Authors Hajime Tanaka, Jack H. Koolen, Woo Sun Lee, William J. Martin

Publication date 24 May 2016

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2534/0.html

zbMATH Keywords

completely regular codedistance-regular graphcoset graphHamming graphLeonard's theorem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Other types of codes (94B60)

Recommendations

• Completely regular codes
• New families of completely regular codes and their corresponding distance regular coset graphs
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• On completely regular codes with minimum eigenvalue in geometric graphs
• An algebraic characterization of completely regular codes in distance-regular graphs

Cited in

(9)

• On completely regular codes
• Completely regular codes
• scientific article; zbMATH DE number 1294398 (Why is no real title available?)
• Distance-2 MDS codes and Latin colorings in the Doob graphs
• On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph
• On completely regular codes with minimum eigenvalue in geometric graphs
• An algebraic characterization of completely regular codes in distance-regular graphs
• Equitable 2-partitions of the Hamming graphs with the second eigenvalue
• On completely regular and completely transitive supplementary codes

This page was built for publication: Arithmetic completely regular codes

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