in Computer Networks
1,276 views
1 vote
1 vote

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

   

in Computer Networks
by
1.3k views

1 Answer

2 votes
2 votes
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

Related questions