Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error
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.
B should be the 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
for good read