Arithmetic completely regular codes
From MaRDI portal
Publication:2808536
zbMATH Open1336.05135MaRDI QIDQ2808536FDOQ2808536
Woo Sun Lee, William J. Martin, Hajime Tanaka, Jack H. Koolen
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
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
Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Other types of codes (94B60)
Cited In (9)
- On completely regular codes
- Completely regular codes
- Title not available (Why is that?)
- 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)
