|
Question : Constructing an 11-bit Hamming Code
|
|
Hello, for several days I have been trying to construct an 11-bit Hamming code for characters A & 3. The redundancy bits calculation is based on r8, r4, r2 & r1.
A = 01000001
3 = 00110011
For A:
R11 R10 R9 R8 R7 R6 R5 R4 R3 R2 R1
1 0 0 - 0 0 0 - 1 - - (even parity add Zero)
R1 1 0 0 - 0 0 0 - 1 0 0 (chceks 1, 3, 5, 7, 9,11)
(even parity add Zero)
R2 1 0 0 - 0 0 0 - 1 0 0 (chceks 2&3, 6&7, 10&11)
(even parity add Zero)
R4 1 0 0 - 0 0 0 0 1 0 0 (chceks 4, 5, 6, 7)
(even parity add Zero)
R8 1 0 0 1 0 0 0 0 1 0 0 (chceks 8, 9,10, 11)
(odd parity add One)
So, the code for A will be 10010000100? I am wondering if I am in the right track.
I have read and tried to follow the steps described on Calculating Hamming Code" (hhttp://www.cs.fiu.edu/~downeyt/cop3402/hamming.html) but I am not sure I am doing this right. Now if this is right. Should I do the same for Number 3 and the put one code after another?
Your step by step explanation wil be greatly appreciated.
thank you.
|
Answer : Constructing an 11-bit Hamming Code
|
|
If you send the message "10010000100 01100011101" (A3), it would be possible to correct and retrieve your original message.
- even with errors in transmission.
With one error in one or both of the two '10010000100' or '01100011101' corection is possible.
If either '10010000100' or '01100011101' is hit with double err., then the failing can be detected, but not corrected.
So the message "10010000101 01100011110" (with fail, double-fail), can be partly decoded :
(A error)
When communicating long distance, sattelite e.g., with disturbance in hails and with poor retransmit possibilities, in that kind of environment other coding schemes would be used .
Hope this was a help
|
|
|
|
|
