Arithmetic completely regular codes
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 comple...
Main Authors: | Jacobus Koolen, Woo Sun Lee, William Martin, Hajime Tanaka |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2016-02-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2150/pdf |
Similar Items
-
Edge-partitioning graphs into regular and locally irregular components
by: Julien Bensmail, et al.
Published: (2016-02-01) -
NP-Completeness Results for Minimum Planar Spanners
by: Ulrik Brandes, et al.
Published: (1998-01-01) -
Hamiltonian decomposition of prisms over cubic graphs
by: Moshe Rosenfeld, et al.
Published: (2015-05-01) -
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles
by: Mickael Montassier, et al.
Published: (2008-01-01) -
Arithmetics in β-numeration
by: Julien Bernat
Published: (2007-01-01)