1,947 views

1 Answer

Best answer
2 votes
2 votes

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.

example - For x6 + 1        

This generator can detect all burst errors with a length less than or equal to 6 bits; 3 out of 100 burst errors with length 7 will slip by; 16 out of 1000 burst errors of length 8 or more will slip by.

Source - Behrouz A. Forouzan

selected by

Related questions

1 votes
1 votes
2 answers
1
rahuldb asked Nov 6, 2016
2,720 views
Consider the information sequence 1101011011.Find the codeword corresponding to this sequencePLEASE SOLVE WITH WORKING
0 votes
0 votes
1 answer
2
durgesh94 asked Jun 15, 2016
1,239 views
(A) checksum (B) even parity mechanism (C) CRC (D) odd parity mechanism.
1 votes
1 votes
1 answer
3
1 votes
1 votes
2 answers
4
cemk asked Sep 13, 2016
1,961 views
If six dice are rolled, what is the probability that each of the six numbers will appear exactly once?