Hamming Code Calculator

Richard Hamming worked at Bell Labs in the late 1940s using early mechanical computers with punch-card input. Tired of the machines stopping on weekend jobs due to single-bit errors ("I found myself asking, \'If the machine can detect the error, why can\'t it correct it?\'"), he developed the first practical single-error-correcting code in 1947 and published it in 1950 as "Error detecting and error correcting codes" in the Bell System Technical Journal.

The Hamming code\'s elegance is in the parity-bit placement: putting parity bits at power-of-2 positions (1, 2, 4, 8, ...) means each data bit contributes to a unique combination of parity checks, and the resulting syndrome — XOR of the parity checks at the receiver — directly identifies the position of any single-bit error. The mathematics generalize to Hamming(2^m−1, 2^m−m−1) codes for any m, with the familiar (7,4) as m=3.

Modern applications: every ECC RAM DIMM uses SEC-DED Hamming (extended with an overall parity bit); NAND flash memory uses Hamming or more powerful BCH codes for per-page ECC; deep-space communication (Voyager, New Horizons) uses concatenated codes with Hamming as the inner code; and CD-ROM/DVD use Reed-Solomon (a generalization of Hamming to multi-bit symbols) for audio/video reliability.

Pick Hamming(7,4) or Hamming(12,8), select encode or decode mode, and enter your bit string. In encode mode, the tool places parity bits at the correct power-of-2 positions and fills them with the XOR of the data bits each covers. In decode mode, it computes the syndrome, identifies any single-bit error position, and reports the corrected data.

(7,4) is the original textbook Hamming code; (12,8) is a useful 8-data-bit variant for aligning with byte-sized storage. Neither detects 2-bit errors reliably — for that, add an overall parity bit (SEC-DED) or use Reed-Solomon / BCH codes. Everything runs client-side; no values leave your browser.