There are no discussions about this article yet.

 Articles by others on the same topic (1)

The Plotkin bound limits a code whose minimum distance is more than the average distance between unrestricted words. For a binary code with

n < 2 d

and even

d

M \leq 2 ⌊ \frac{d}{2 d - n} ⌋ .

Plotkin bound