Some remarks on the Plotkin bound
Summary: 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 the Hamming and Lee metrics 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 \textit{A. Wyner} and \textit{R. Graham} [Inf. Control 13, 46-52 (1968; Zbl 0174.50901)] is improved.
scientific article; zbMATH DE number 1985381