Consider a simple code in which each codeword consists of $2$ data bits $[d1, d0]$ and $3$ check bits $[c2, c1, c0]$.
The check bits are computed as follows:
$c2 = d1 \oplus d0$, where $\oplus$ is the modulo – $2$ sum
$c1 = d1$, and
$c0 = d0$.
(i) Determine the minimum Hamming distance between any two distinct codewords of this code.
(ii) How many errors in a codeword can be detected by this code? Justify your answer.
(iii) How many errors in a codeword can be corrected by this code? Justify your answer.