Hamming Code
Tick the boxes to set the bits of the received data word.
| Bit position | 12 | 11 | 10 | 09 | 08 | 07 | 06 | 05 | 04 | 03 | 02 | 01 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Data(M) or Parity(C) | M8 | M7 | M6 | M5 | C8 | M4 | M3 | M2 | C4 | M1 | C2 | C1 |
| Data Received | ||||||||||||
| Hamming Code for Received Data | ||||||||||||
| Error Position |
Errors not found
How it works
The simplest of the error-correcting codes is the Hamming code devised by Richard Hamming at Bell Laboratories. To clarify the concept involved, the calculator was developed that finds the position of a single-bit error in an 8-bit word stored with four check bits. Inverting the bit in that position corrects the word. Two errors cannot be corrected: the calculator names a wrong position or reports more than one error.