$(13$ marks$)[$Parity checks $($Learning Outcome $3)]$

Suppose the data in a packet, $D=100111101000100101010100111001111001,$ is to be

protected by a two$-$dimensional parity scheme and an odd parity scheme is being used.

What would the parity bits be such that the EDC field in the packet has minimum$-$length?

Refer to pages $9$ and $11$ of $13\_$Link$\_$I$\_$COMP$3234$B$\_$s$2024.$pdf$.$ Give the answer in the form

like the following:

$10101|$

$111100$

$01110|1$

$001010$Suppose the data in a packet, D$=100111101000100101010100111001111001,$ is to be

protected by a two$-$dimensional parity scheme and an odd parity scheme is being used.

What would the parity bits be such that the EDC field in the packet has minimum$-$length?

Give the answer in the form

like the following: