Gilbert–Varshamov bound

views updated

Gilbert–Varshamov bound The theorem that the maximum possible number, N, of codewords in a binary linear block code is bounded by

where the code length is n digits, and the codewords are at a minimum Hamming distance d. See also coding bounds, Hamming bound.