in Digital Logic edited by
528 views
0 votes
0 votes

Consider a simple code $\mathcal{C}$ for error detection and correction. Each codeword in $\mathcal{C}$ consists of $2$ data bits $[d_1, d_0]$ followed by check bits $[c_2, c_1, c_0]$. The check bits are computed as follows: $c_2 = d_1+d_0, \: c_1=d_1$ and  $c_0=d_0$, where $'+'$ is a modulo-$2$ addition.

  1. Write down all the codewords for $\mathcal{C}$
  2. Determine the minimum Hamming distance between any two distinct codewords of $\mathcal{C}$
in Digital Logic edited by
528 views

1 Answer

1 vote
1 vote

The Minimum hamming distance between any two distinct codewords will be 3.Here as per given $d_1,d_0$ are independent..Hence taken them into consideration.

Related questions