edited by
75 views
1 votes
1 votes

Assume you are using a binary code error correcting code $C$. If the minimum Hamming distance between any two codewords of $C$ is $3$. Then

  1. We can correct and detect $2$ bit errors.
  2. We can correct $1$ bit errors and detect $2$ bit errors.
  3. We can correct $2$ bit errors and detect $1$ bit errors.
  4. We can correct $1$ bit errors and detect $1$ bit errors.
  5. None of the above.
edited by

Please log in or register to answer this question.