Cyclic Codes MCQs in Information theory coding technique & communication networks For All competitive & SPPU online exams 2020.
Before solving this i suggest read this to easy this objectives
1. Construction of Galois Field GF(2m) is needed in generation of cyclic codes specifically to
a. Perform Polynomial Division
b. Decode the cyclic code
c. Determine the Generator Polynomial
d. None of the above
Ans - C
2. The received code contains an error if the syndrome vector is
a. Zero
b. Non zero
c. Infinity
d. None of the mentioned
Ans - B
3. Basically, Galois field consists of ______ number of elements.
a. Finite
b. Infinite
c. Both a and b
d. None of the above
Ans - A
4. In register contents at decoder, the syndrome register consists of syndrome after all bits of received vector are clocked into the decoder ________.
a. Input
b. Output
c. Both a and b
d. None of the above
Ans - A
5. In decoding of cyclic code, which among the following is also regarded as 'Syndrome Polynomial'?
a. Generator Polynomial
b. Received code word Polynomial
c. Quotient Polynomial
d. Remainder Polynomial
Ans - D
6. While decoding the cyclic code, if the received code word is similar as transmitted code word, then r(x) mod g(x) is equal to _________
a. Zero
b. Unity
c. Infinity
d. None of the above
Ans - A
7. What is the value of leading coefficient of a monic polynomial?
a. 0.5
b. 1
c. 4
d. 16
Ans - B
8. Linear codes are used for
a. Forward error correction
b. Backward error correction
c. Forward error detection
d. Backward error detection
Ans - A
9. For designing of (4,1) cyclic repetition code, what would be the
order of the generator polynomial g(x)?
a. 1
b. 3
c. 4
d. 5
Ans - B
10. Consider the assertions related to decoding process of cyclic code. Which among the following is a correct sequence of steps necessary for the correction of errors?
A. Syndrome determination after the division of r(x) & g(x)
B. Addition of error pattern to received code word
C. Selection of error pattern corresponding to the syndrome
D. Preparation of table comprising error patterns and syndromes
a. A, B, C, D
b. B, A, D, C
c. C, B, D, A
d. D, A, C, B
ANs - D
11. For the generation of a cyclic code, the generator polynomial should be the factor of _____
a. x^(n) + 1
b. x^(n) – 1
c. x^(n) /2
d. x^2n/30
Ans - A
12. Generally, a primitive polynomial of degree 'm' is an irreducible polynomial in such a way that it is a factor of xn + 1, where 'n' =
______
a. 2m - 1
b. m/n - 1
c. (m+1) /2
d. m-n-1
Ans – A
13. Which among the below stated logical circuits are present in encoder and decoder used for the implementation of cyclic codes?
A. Shift Registers
B. Modulo-2 Adders
C. Counters
D. Multiplexers
a. A & B
b. C & D
c. A & C
d. B & D
Ans - A
14. The cyclic codes are designed using
a. Shift registers with feedback
b. Shift registers without feedback
c. Flip flops
d. None of the mentioned
Ans - A
15. A cyclic code can be generated using --------- & block codes can be generated using -----------
a. Generator polynomial, Generator matrix
b. Generator matrix, Remainder polynomial
c. Generator matrix & Generator polynomial
d. None of the mentioned
Ans - A
16. According to linearity property, the ________ of two code words in a cyclic code is also a valid code word.
a. sum
b. difference
c. product
d. division
Ans - A
17. A prime polynomial is a polynomial that is
a. A monic polynomial which is irreducible and has a degree at least one
b. A monic polynomial which is reducible and has a degree at least one
c. A monic polynomial which is irreducible and has a degree greater than one
d. None of the above
Ans - A
18. Cyclic Property of cyclic codes indicates that
a. A cyclic shift of bits in a code word gives rise to another valid code word
b. Sum of two code words is a valid code word
c. Polynomial Product of two code words is a valid code word
d. Polynomial Division of two code words is a valid code word
Ans - A
19. Galois Field GF(8) can take ------- different values
a. 3
b. 8
c. 1
d. 0
Ans - B
20. Galois Field GF(3 ) will have the following elements
a. {1,2,3}
b. {4,5,6}
c. {0,1,2}
d. None of the above
Ans - C
21. For any m = 3, there exists an irreducible polynomials of degree ‘m’ which divides ---------
a. x2 + 1
b. x3 +1
c. x7 -1
d. x7 +1
Ans – D
22. Following polynomials are primitive polynomials
a. x3+x+1
b. x4+x3+x2+x+1
c. x4 +x+1
d. a and c
Ans - d
23. Given Galois Field GF(2), the extended field is represented as
a. GF(2m)
b. GF(m2)
c. GF(2m)
d. GF(m/2)
Ans - C
24. Minimal polynomial of GF(23) element 0 is
a. 1
b. 0
c. x
d. x+1
Ans - C
25. Minimal polynomial of GF(23) element 1 is
a. 1
b. 0
c. x
d. x+1
Ans - D
26. Cyclic code polynomial c(x) can be generated using data polynomial of degree (k-1) and generator polynomial g(x) of degree (n-k) as
a. c(x) = d(x).g(x)
b. c(x) = d(x) mod g(x)
c. c(x) = d(x) - g(x)
d. None of the above
Ans - A
27. For systematic cyclic codes, x(n-k)d(x) +p(x) = q(x).g(x)
a. p(x) are remainder (k-1) bits & q(x).g(x) are shifted message bits
b. p(x) are remainder (k-1) bits & q(x).g(x) is code
c. p(x) are remainder (k-1) bits & q(x).g(x) is code
d. p(x) are remainder (k-1) bits & x(n-k)d(x) is code
Ans - B
28. With reference to Decoding of cyclic code following is true
a. r(x) = c(x) modulo 2 addition e(x) , where r(x) is received codeword polynomial , e(x) is error polynomial & c(x) is codeword polynomial
b. r(x) = c(x) + e(x)
c. r(x) = c(x) - e(x)
d. r(x) = c(x) modulo 2 multiplication e(x)
Ans - A
29. Encoding and Decoding of cyclic codes involves
a. Multiplication of Polynomials
b. Polynomial Subtraction
c. Division of Polynomials
d. None of the above
Ans - C
30. For the generation of a cyclic code, the generator polynomial
should be the factor of _____
a. xn + 1
b. xn – 1
c. xn /2
d. x2n/3
31. The Decoding algorithm for Cyclic code is known as:
a) Viterbi decoding
b) Zeiler Gorenstein decoding
c) Sequential decoding
d) Syndrome decoding
Ans - D
32. Number of parity bits are equal to highest power of :
a) Generator Polynomial
b) Received code word Polynomial
c) Minimal Polynomial
d) Remainder Polynomial
Ans - A
33. Generation of non-systematic cyclic code:
a) g(x)-m(x)
b) g(x)+m(x)
c) g(x)*m(x)
d) g(x) mod m(x)
Ans - C
34. Systematic Code means:
a) Parity bits and message bits are interleaved in codeword bits
b) Only message bits are present in codeword bits
c) Parity bits and message bits are clearly separated in codeword bits
d) Encoding is done in systematic way
Ans - C
35. Which one of the following is extension field?
a) GF(2)
b) GF(3)
c) GF(4)
d) GF(5)
Ans - C
36. With respect to the Galois Field GF(3), 2+2=
a) 1
b) 2
c) 3
d) 4
Ans - A
37. For Galois Field GF(q)=GF(p^m), which set of rules will be
applicable for addition and multiplication?
a) modulo-2
b) modulo-q
c) modulo-p
d) modulo-m
Ans - B
38. For Galois Field GF(p^m),which statement is true?
a) p is a prime number
b) m is a prime number
c) p^m is a prime number
d) p always having value as 2
Ans - A
39. For Primitive element a, a^7=1 can be the case for:
a) GF(2)
b) GF(4)
c) GF(8)
d) GF(16)
Ans -C
40. Minimal Polynomial is function of_____of field elements
a) Multiple
b) Conjugate
c) Inverse
d) Summation
Ans - B
Before solving this i suggest read this to easy this objectives
If you like this comment good and share with your friends.
