GATE | GATE-CS-2009 | Question 48

Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error?

(A) G(x) contains more than two terms
(B) G(x) does not divide 1+x^k, for any k not exceeding the frame length
(C) 1+x is a factor of G(x)
(D) G(x) has an odd number of terms.


Answer: (C)

Explanation: Odd number of bit errors can be detected if G(x) contains (x+1) as a factor. See this for proof.

Quiz of this Question



My Personal Notes arrow_drop_up

Recommended Posts:



5 Average Difficulty : 5/5.0
Based on 1 vote(s)






User Actions