Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths

  • Paul Dorbec
  • Michel Mollard
DOI: https://doi.org/10.37236/1962

Abstract

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 length 2 and of infinite length. Both existence and nonexistence results are given.

Published
2005-11-29
How to Cite
Dorbec, P., & Mollard, M. (2005). Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths. The Electronic Journal of Combinatorics, 12(1), R65. https://doi.org/10.37236/1962
Issue
Volume 12 (2005)
Article Number
R65