Gilbert–Varshamov bound

Related Overviews


'Gilbert–Varshamov bound' can also refer to...


More Like This

Show all results sharing this subject:

  • Computing


Show Summary Details

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

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.