CRCs in four-dimensional lattice graphs
math.CO
Submitted: 2026-10-30
Updated: 2026-10-30
License: http://creativecommons.org/publicdomain/zero/1.0/
The gist: We obtain series of new completely regular codes in Cayley graphs of the groups Z q n with the Lee metric.
Abstract
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 at most 7 up to parameter matrices.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality