Perfect codes in Cartesian products of 2-paths and infinite paths (Q2583665)

A perfect code is a set of codewords such that disjoint spheres of a given radius with respect to a metric centered around the codewords cover the ambient space. The authors generalize the standard definition to the Cartesian product of the graph of the hypercube of dimension \(k\) and infinite grid. They produce both existence and non-existence results for these codes.