The Gateway to Computer Science Excellence
0 votes
263 views

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 (123 points) | 263 views

1 Answer

+1 vote
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
by Active (4k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,170 answers
193,841 comments
94,047 users