In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere-packing bound or the volume bound from an interpretation in terms of packing balls in the Hamming metric into the space of all possible words. It gives an important limitation on the efficiency with which any error-correcting code can utilize the space in which its code words are embedded. A code which attains the Hamming bound is said to be a perfect code.
Read more about Hamming Bound: Background On Error-correcting Codes, Statement of The Bound, Proof, Covering Radius and Packing Radius, Perfect Codes
Famous quotes containing the word bound:
“When you think of the huge uninterrupted success of a book like Don Quixote, you’re bound to realize that if humankind have not yet finished being revenged, by sheer laughter, for being let down in their greatest hope, it is because that hope was cherished so long and lay so deep!”
—Georges Bernanos (1888–1948)