Perfect codes in Cartesian products of hypercube and multidimensional grid

We introduce and study a common generalization of 1-error binary perfect codes and perfect single error correcting codes in Lee metric, namely perfect codes on products of paths of lenght 2 and of infinite lenght. Both existence and inexistence results are given. The generalization to multiple error perfect code will also be mentioned.