Some remarks on the Plotkin bound (Q1408546)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some remarks on the Plotkin bound |
scientific article; zbMATH DE number 1985381
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some remarks on the Plotkin bound |
scientific article; zbMATH DE number 1985381 |
Statements
Some remarks on the Plotkin bound (English)
0 references
24 September 2003
0 references
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.
0 references
Plotkin's bound
0 references
Hamming metric
0 references
Lee metric
0 references
