PreprintCC0arXiv
CRCs in four-dimensional lattice graphs
Abstract
We obtain series of new completely regular codes in Cayley graphs of the groups Zqn with the Lee metric. Combined with binary linear programming methods, the constructions lead to enumeration of all completely regular codes in such graphs for the groups Zq4, q≤ 7 up to parameter matrices.
Related
- The optimal four-dimensional lattice quantizer and bounds from Voronoi facets
- Deciding lettericity is NP-complete, even for four-colorable comparability graphs
- Lattice paths on snake graphs for q-deformed rationals
- Discrete Dirac equation on quantum graphs: A model of a Dirac particle in a branched lattice
- Sharp dispersive estimates for wave equation on lattice graphs with high dimension
BibTeX
@misc{mogilnykh2026crcs,
title = {{CRCs in four-dimensional lattice graphs}},
author = {Ivan Mogilnykh},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41716},
eprint = {2610.41716},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41716},
note = {CC0},
}
RIS
TY - UNPB
TI - CRCs in four-dimensional lattice graphs
AU - Ivan Mogilnykh
PY - 2026
DA - 2026/10/30
PB - arXiv
DO - 10.48550/arxiv.2610.41716
UR - https://arxiv.org/abs/2610.41716
AB - We obtain series of new completely regular codes in Cayley graphs of the groups Z_q^n with the Lee metric. Combined with binary linear programming methods, the constructions lead to enumeration of all completely regular codes in such graphs for the groups Z_q^4, q≤ 7 up to parameter matrices.
ER -