\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Paul Dorbec and Michel Mollard}
%
%
\medskip
\noindent
%
%
{\bf Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths}
%
%
\vskip 5mm
\noindent
%
%
%
%
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.

\bye