On null completely regular codes in Manhattan metric
Combinatorics
2025-05-16 v1 Information Theory
math.IT
Abstract
We investigate the class of completely regular codes in graphs with a distance partition C_0,..., C_\rho, where each set C_i, for 0<=i<=r-1, is an independent set. This work focuses on the existence problem for such codes in the n-dimensional infinite grid. We demonstrate that several parameter families of such codes necessarily arise from binary or ternary Hamming graphs or do not exist. Furthermore, employing binary linear programming techniques, we explore completely regular codes in infinite grids of dimensions 3 and 4 for the cases r=1 and r=2.
Cite
@article{arxiv.2505.09893,
title = {On null completely regular codes in Manhattan metric},
author = {I. Yu. Mogilnykh and A. Yu. Vasil'eva},
journal= {arXiv preprint arXiv:2505.09893},
year = {2025}
}