Completely regular codes in the $n$-Dimensional Rectangular Grid

Аннотация

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$.