Hamming Codes

• For n data bits and k check bits, n+k ? 2k-1

• Grouping of bits for parity generation can be observed from listing of binary numbers:

B1 B2 B3

0 0 0 0

1 1 0 0

2 0 1 0

3 1 1 0

4 0 0 1

5 1 0 1

6 0 1 1

7 1 1 1

B1=1 for (1,3,5,7)

B2=1 for (2,3,6,7)

B3=1 for (4,5,6,7)

Previous slide

Next slide

Back to first slide

View graphic version