Hamming Code

Hamming Code
 There's an error correction
code that separates the bits
holding the original value
(data bits) from the error
correction bits (check bits),
and the difference between
the calculated and actual
error correction bits is the
position of the bit that's
wrong
 ForM data bits and K check bits, we must
have:
2K – 1 >= (M+K)

Calculate Check bits for M = 8?

Hamming Code Calculation
Bit Position 12 11 10 9 8 7 6 5 4 3 2 1

Position no
(Binary)
Data bits
o o o o o o o o

Check bits
x x x x
(Power of 2’s)
Calculate the Hamming word for data = 00111001