Hamming bound

views updated

Hamming bound (sphere-packing bound) 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.

About this article

Hamming bound

Updated About encyclopedia.com content Print Article