Some remarks on the Plotkin bound
type: Item
instance of: scholarly article
title: Some remarks on the Plotkin bound
zbMATH Open document ID: 1029.94042
author: Jörn Quistorff
published in: The Electronic Journal of Combinatorics
publication date: 2003-09-24T00:00:00Z
full work available at URL: https://eudml.org/doc/123186
full work available at URL: v10i1n6.html
review text: 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.
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 1985381
zbMATH Keywords: Plotkin's bound
zbMATH Keywords: Hamming metric
zbMATH Keywords: Lee metric
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1985381