 |
|
|
|
|
|
|
|
|
 |
 |
 |
 |
 |
 |
 |
 |
|
Coding of Hamming
Problem of Decoding
The transmission was made, we are then at the level of the receiver (in a network card for example). We have to unpacked the successful message, that is remove the bits of control. For that purpose, we are going to redo the same manipulation as in the coding: for every bit of parity, we verify that the sum is even (or odd according to the parity used for the coding); we keep in memory every bit of erroneous parity; at the end, when all the bits were verified, we add the value of every bit of erroneous parity. The value which results from this sum gives us the number of the erroneous bit.
