|
Discrete mathematics and mathematical cybernetics
Completely regular codes in the $n$-dimensional rectangular grid
S. V. Avgustinovicha, A. Yu. Vasil'evaab a Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
b Novosibirsk State University, Pirogova str., 1, 630090, Novosibirsk, Russia
Abstract:
It is proved that two sequences of the intersection array of an arbitrary completely regular code in the $n$-dimensional rectangular grid are monotonic. It is shown that the minimal distance of an arbitrary completely regular code is at most $4$ and the covering radius of an irreducible completely regular code in the grid is at most $2n$.
Keywords:
$n$-dimensional rectangular grid, completely regular code, intersection array, covering radius, perfect coloring.
Received August 17, 2022, published November 11, 2022
Citation:
S. V. Avgustinovich, A. Yu. Vasil'eva, “Completely regular codes in the $n$-dimensional rectangular grid”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 861–869
Linking options:
https://www.mathnet.ru/eng/semr1545 https://www.mathnet.ru/eng/semr/v19/i2/p861
|
Statistics & downloads: |
Abstract page: | 93 | Full-text PDF : | 32 | References: | 19 |
|