Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A system uses even parity. The byte 01101001 is sent. On the way, interference flips two bits, and the byte 01011001 arrives.
Interference can cause data loss, data gain and data change. With even parity the parity bit makes the number of 1s in the byte even; with odd parity it makes it odd. The receiver counts the 1s in each byte: the wrong parity means an error. An even number of flipped bits is not detected.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Count. 01011001 has ones.
Step 2. Compare. Sent 01101001, received 01011001. Positions and differ. So bits changed: one became and one became .
Step 3. The check. is even, so the check passes, and the error is not detected. One flip took a 1 away and the other added a 1, so the count stayed even.
Step 4. A better method. A checksum over the whole block would very likely change, so it would find the error. An echo check would also find it, because the sender would see that the returned byte differs.
Answer: (a) . (b) . (c) No: two flips keep the count even. A checksum or an echo check could find it.
Log in to join the discussion.
Loading…