11. Richard Hamming, known for the Hamming code and Hamming distance, is also an alumnus. 12. To remedy this shortcoming, Hamming codes can be extended by an extra parity bit. 13. As m varies, we get all the possible Hamming codes : 14. He invented the concepts known as Hamming codes , Hamming windows, Hamming numbers, and Hamming distance. 15. In this context, an extended Hamming code having one extra parity bit is often used. 16. He created the Hamming code and the Hamming distance and developed methods for code optimality proofs. 17. However, the Hamming code approach works by concentrating wrong guesses together onto certain distributions of hats. 18. Thus the Hamming code strategy yields greater win rates for larger values of " N ". 19. The Hamming code adds three additional check bits to every four data bits of the message. 20. In this sense, extended Hamming codes are single-error correcting and double-error detecting, abbreviated as "'SECDED " '. 