Error detection

Question

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

A	t + 1
B	t
C	t - 2
D	t / 2

   

Answer 1

option (B)

we know that in error correction technique(hamming code)

d>=2p+1 when d is distance and p is number of error bits

here d=2t+1 so 2t+1>=2p+1 =>p <=t so maximum value is p =t

Answer 2

✅" option B "

as we know   

for coorecting error d min >= t-1/2

here t = 2t+1 hence evalution becomes  t = 2t+1 , put in the formula

d = 2t+1-1/2 =t