Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming Algorithm presented in the our class. We now receive the following code word: 1 0 1 0 1 0 1 1 1 1 0 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? You are required to show all the steps on a piece of paper. write it out on a piece of paper answer options below No it is illegal code word - bit 6 is in error Yes it is legal code word and there is no error No it is illegal code word - bit 5 is in error No it is illegal code word - bit 3 is in error
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming
1 0 1 0 1 0 1 1 1 1 0
Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?
You are required to show all the steps on a piece of paper.
write it out on a piece of paper
answer options below
|
No it is illegal code word - bit 6 is in error |
|
Yes it is legal code word and there is no error |
|
No it is illegal code word - bit 5 is in error |
|
No it is illegal code word - bit 3 is in error |
Step by step
Solved in 3 steps