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

 For

M data bits and K check bits, we must have: 2K – 1 >= (M+K)

Calculate Check bits for M = 8?

Hamming Code Calculation
Bit Position Position no (Binary) Data bits Check bits (Power of 2’s) 12 11 10 9 8 7 6 5 4 3 2 1



o o x

o o o x

o x x

Calculate the Hamming word for data = 00111001

Sign up to vote on this title
UsefulNot useful