Hamming bound

Related Overviews


'Hamming bound' can also refer to...


More Like This

Show all results sharing this subject:

  • Computing


Show Summary Details

Quick Reference

The theorem that the number, N, of codewords in a binary linear code is bounded by where the code length is n digits, and the code is capable of correcting e errors. See also coding bounds, Gilbert-Varshamov 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.