In the mathematics of coding theory, the Plotkin bound, named after Morris Plotkin, is a limit (or bound) on the maximum possible number of codewords in binary codes of given length n and given minimum distance d. == Statement of the bound == A code is considered "binary" if the codewords use symbols from the binary alphabet { 0 , 1 } {\displaystyle \{0,1\}} .
In the mathematics of coding theory, the Plotkin bound, named after Morris Plotkin, is a limit (or bound) on the maximum possible number of codewords in binary codes of given length n and given minimum distance d. == Statement of the bound == A code is considered "binary" if the codewords use symbols from the binary alphabet { 0 , 1 } {\displaystyle \{0,1\}} .
Source: Wikipedia "Plotkin bound" · CC BY-SA 4.0
Share this article: X · Bluesky