Q. Show the Error Correction by Hamming Code?

Hamming Code is able to be applied to data units of any length and uses the relationship between data and redundancy bits

For instance a 7-bit ASCII code requires 4 redundancy bits that can be added to the end of the data unit or mixed with the original data bits which are placed in positions 1, 2, 4 and 8 that is x0,x1,x2,x3 etc.

In the Hamming Code every "r" bit for one combination of data bits as below:

• r1: bits 1, 3, 5, 7, 9, 11
• r2: bits 2, 3, 6, 7, 10, 11
• r3: bits 4, 5, 6, 7
• r4: bits 8, 9, 10, 11