2,510 views

Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error

1. $t+1$
2. $t$
3. $t-2$
4. $t/2$

Option B)

Question should be framed correctly. In a set of codewords with hamming distance 2t + 1 , t errors can be corrected.

A code is t-errors correcting if, and only if, the minimum Hamming distance between any two of its codewords is at least 2t+1.

## Number of error bits to be corrected = (2t + 1 - 1)/2  = 2t / 2 = t (Answer)

because in "t" bit Error Detaction we need minimum distance = t+1

and in "t" bit Error Correction we need minimum distance = 2t+1

http://www.eecs.umich.edu/courses/eecs373.w05/lecture/errorcode.html#:~:text=Minimum%20Hamming%20distance%20for%20error%20correction,of%202d%20%2B%201%20is%20required.

1 vote