Plotkin bound

In the channel coding using block codes to detect and correct errors in data streams can be. A block code of length about one -ary alphabet, with a minimum distance satisfies the Plotkin boundary, also referred to as barrier Plotkin,

Takes a code to the Plotkin barrier, as is true in particular that the distance between any two codewords is accurate.

If and so applies even sharper relationship:

For example, the Plotkin - limit, and only, tightening supplies, however, since there is a contradiction for and.

It was published in 1960 by Morris Plotkin.