I'm currently learning how Hamming codes work and so far I am understanding it!
I have worked through several examples, and it seems to work well following the below table:
Where I get stuck however is when I have an example which its length means it ends on a parity bit. For example:
Ignore the meaning of obviously random binary string above, but the fact that it is 16 bits long, when you are error checking it, you start with p1 and then do p2, p4, p8 and finally p16. What I don't understand however, is that as there are no digits after position 16, how am I meant to work out if p16 is correct or not. If the string was 20 bits long, I know you just count 16 and skip 16, starting at p16. However as there are no bits after p16 I am a bit stuck.
If anyone has any idea, that would be awesome!