-
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?
-
- G(x) contains more than two terms
- G(x) does not divide 1 + xk, for any k not exceeding the frame length
- 1 + x is a factor of G(x)
- G(x) has an odd number of terms
- G(x) contains more than two terms
Correct Option: C
The solution is just based on the very basic concepts regarding CRC checking. There are two ways by which the solution can be out by using the basic concepts.
Solution 1 –
There are odd numbers of bit in the error. Due to which, the error function will have a factor of (1 + x2 + x4 + ....). Now this can never be divided by the generator having Now this can never be divided by the generator having (1 + x) as a factor.
Solution 2 –
In a polynomial code method, the sender and receiver mutually agrees on a generator polynomial G(x). Here, both of the high order bit and the low order bit and the low order bit of the generator must be 1. Hence, 1 + x is a factor of G(x).
