Perfect codes in Cartesian products of 2-paths and infinite paths
The electronic journal of combinatorics, Tome 12 (2005)
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.
@article{10_37236_1962,
author = {Paul Dorbec and Michel Mollard},
title = {Perfect codes in {Cartesian} products of 2-paths and infinite paths},
journal = {The electronic journal of combinatorics},
year = {2005},
volume = {12},
doi = {10.37236/1962},
zbl = {1081.05091},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1962/}
}
Paul Dorbec; Michel Mollard. Perfect codes in Cartesian products of 2-paths and infinite paths. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1962
Cité par Sources :