Understanding the Hamming 'sphere packing' bound in coding theory

from blog Kevin Boone's website, | ↗ original
The Hamming bound is an important metric in the evaluation of information coding schemes. It sets an upper limit on the number of distinct codewords that an error-correcting block code can provide, for a given block length. The Hamming bound is a benchmark for the evaluation of error correction schemes used in digital data storage and...