o achieve minimum distance 3, it will suffice to have parity bits with the following properties: (a) each bit of the original message appears in at least two parity bits. (b) no two bits of the...

o achieve minimum distance 3, it will suffice to have parity bits with the following properties:

(a) each bit of the original message appears in at least two parity bits.

(b) no two bits of the original message appear in exactly the same set of parity bits.