Next: Binary hamming codes
Up: Error-correcting codes
Previous: Application: The hats problem
  Contents
  Index
In this section, we present a commonly used linear
error-correcting code which corrects
exactly one error. In addition, it is the
``shortest'' code (linear or not) to do so.
It was discovered by Hamming in the 1940's, in the days
when an computer error would crash the computer
and force the programmer to retype his punch cards.
Out of frustration, he tried to design a system
whereby the computer could automatically correct certain
errors.
Subsections
David Joyner
2002-08-23