hamming code Algorithm

Hamming codes are perfect codes, that is, they achieve the highest possible rate for codes with their block length and minimum distance of three. By contrast, the simple parity code can not correct mistakes, and can detect only an odd number of bits in mistake. Richard Hamming, the inventor of Hamming codes, worked at Bell Labs in the late 1940s on the Bell model V computer, an electromechanical relay-based machine with cycle times in seconds. In 1950, he published what is now known as Hamming code, which remains in purpose today in applications such as ECC memory. Hamming worked on weekends, and grew increasingly frustrated with have to restart his programs from scratch due to detected mistakes.

hamming code source code, pseudocode and analysis

COMING SOON!