High Quality Content by WIKIPEDIA articles! In the mathematics of coding theory, the Plotkin bound, named after Morris Plotkin, is a bound on the maximum possible number of codewords in binary codes of given length n and given minimum distance d.We say a code is binary, if the codewords use symbols from the binary alphabet {0,1}. In particular, if all codewords have a fixed length n, we speak of a binary code of length n.The expression A2(n,d) represents the maximum number of possible codewords in a binary code of length n and minimum distance d. The Plotkin bound places a limit on this expression.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.