Finding and fixing a bad bit

The above example created a code word of 011100101010. Suppose the word that
was received was 011100101110 instead. Then the receiver could calculate
which bit was wrong and correct it. The method is to verify each check bit.
Write down all the incorrect parity bits. Doing so, you will discover that
parity bits 2 and 8 are incorrect. It is not an accident that 2 + 8 = 10,
and that bit position 10 is the location of the bad bit. In general, check
each parity bit, and add the positions that are wrong, this will give you
the location of the bad bit.

Try one yourself

Test if these code words are correct, assuming they were created using an
even parity Hamming Code . If one is incorrect, indicate what the correct
code word should have been. Also, indicate what the original data was.