Essentials Of Computer Organization And Architecture 4th Edition by Linda Null,Julia Lobur

Exercise 15

Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. We have already calculated that we need 5 check bits, and the length of all code words will be 17. Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word:
0 1 1 0 0 1 0 1 0 0 1 0 0 1 0 0 1
Assuming even parity, is this a legal code word If not, according to our error-correcting code, where is the error