Gilbert–Varshamov bound

Quick Reference

The theorem that the maximum possible number, N, of codewords in a binary linear block code is bounded bywhere the code length is n digits, and the codewords are at a minimum Hamming distance d. See also coding bounds, Hamming bound.

Subjects: Computing.

Reference entries