Skip to Main content Skip to Navigation
New interface
Journal articles

Arithmetic completely regular codes

Abstract : In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these "arithmetic completely regular codes", we focus on cartesian products of completely regular codes and products of their corresponding coset graphs in the additive case. Employing earlier results, we are then able to prove a theorem which nearly classifies these codes in the case where the graph admits a completely regular partition into such codes (e.g, the cosets of some additive completely regular code). Connections to the theory of distance-regular graphs are explored and several open questions are posed.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 17, 2016 - 11:39:06 AM
Last modification on : Friday, November 3, 2017 - 10:24:07 PM
Long-term archiving on: : Friday, November 18, 2016 - 10:10:35 AM


Explicit agreement for this submission




Jacobus Koolen, Woo Sun Lee, William Martin, Hajime Tanaka. Arithmetic completely regular codes. Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.59-76. ⟨10.46298/dmtcs.2150⟩. ⟨hal-01352844⟩



Record views


Files downloads