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:
“Nature in darkness groans
And men are bound to sullen contemplation in the night:
Restless they turn on beds of sorrow; in their inmost brain
Feeling the crushing wheels, they rise, they write the bitter words
Of stern philosophy & knead the bread of knowledge with tears & groans.”
—William Blake (1757–1827)