1,551 views
1 1 vote

I think for (C), it should be The probability of "not detecting" a burst error of size 9 is $\frac{1}{2^7}$

And for (D), the probability of detecting burst error of size 15 should be  $1-\frac{1}{2^8}$

 

Correct me if I am wrong.

1 Answer

3 3 votes

IF L is length of burst error  &  polynomial generator has highest degree as r.

1.All burst errors with L ≤ r will be detected.

2.All burst errors with L = r + 1 will be  detected with probability 1 – (1/2)r–1.

3.All burst errors with L > r + 1 will be detected with probability 1 – (1/2)r.

Now , as r = 8 here so it will be able to detect burst error of size 6 and it will dtect single bit error so option a and b are true

Now probabiltiy of detecting burst error of size 9 = 1-(1/2)^8 -------[by second rule as L = r+1, L=9 and r = 8]

and probabiltiy of detecting burst error of size 15 = 1-(1/2)^15-----[by third rule as L>r+1, L=15 and r = 8]

so both option c and option d are false 

Position:
Show:

Related questions

4 4 votes
1 1 answer
1.6k
1.6k views
rahul sharma 5 asked Aug 17, 2017
1,554 views
From forouzan : If the generator has more than one term and coefficient of x^0 is 1 then all single bit error can be caught.So if e(x)=x^i // means some power of 2 number...
1 1 vote
2 2 answers
1.3k
1.3k views
erh asked Jul 21, 2016
1,271 views
Why don't we use CRC in IP header instead of Checksum?
17 17 votes
2 2 answers
2.1k
2.1k views
gatecse asked Feb 23
2,148 views
Consider the transmission of data bits $110001011$ over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to ...
2 2 votes
0 0 answers
442
442 views
bjayesh asked Aug 15, 2025
442 views
Statement mentioned in the book: If the generator has more than one term and the coefficient of is $x_0$ is 1, all single-bit errors can be caught.Doubt: Why does the co...