\magnification=1200
\hsize=4in
\overfullrule=0pt
\nopagenumbers
\noindent
%
%
{\bf J\"o{}rn Quistorff}
%
%
\medskip
\noindent
%
%
{\bf Some Remarks on the Plotkin Bound}
%
%
\vskip 5mm
\noindent
%
%
%
%
In coding theory, Plotkin's upper bound on the maximal cadinality of a
code with minimum distance at least $d$ is well known. He presented it
for binary codes where Hamming and Lee metric coincide. After a brief
discussion of the generalization to $q$-ary codes preserved with the
Hamming metric, the application of the Plotkin bound to $q$-ary codes
preserved with the Lee metric due to Wyner and Graham is improved.

\bye