Unit V DIGITAL COMMUNCATION R2017 MCQ

Unit V - Error Control Coding
1. A linear code
a. Sum of code words is also a code word
b. All-zero code word is a code word
c. Minimum hamming distance between two code words is equal to weight of any non zero code
word
d. All of the above
Answer : d
2. For decoding in convolution coding, in a code tree,

a. Diverge upward when a bit is 0 and diverge downward when the bit is 1
b. Diverge downward when a bit is 0 and diverge upward when the bit is 1
c. Diverge left when a bit is 0 and diverge right when the bit is 1
d. Diverge right when a bit is 0 and diverge left when the bit is 1
Answer: a
3. The code in convolution coding is generated using

a. EX-OR logic
b. AND logic
c. OR logic
d. None of the above
Answer: a
4. For a (7, 4) block code, 7 is the total number of bits and 4 is the number of
a. Information bits
b. Redundant bits
c. Total bits- information bits
Answer : a
5. Parity bit coding may not be used for
a. Error in more than single bit
b. Which bit is in error
c. Both a & b
Answer : c
6. For hamming distance dmin and t errors in the received word, the condition to be able to
correct the errors is
a. 2t + 1 ≤ dmin
b. 2t + 2 ≤ dmin
c. 2t + 1 ≤ 2dmin
d. Both a and b
Answer: d
7. For hamming distance dmin and number of errors D, the condition for receiving invalid
codeword is
a. D ≤ dmin + 1
b. D ≤ dmin – 1
c. D ≤ 1 – dmin
d. D ≤ dmin
Answer : b
8. For a (6,4) block code where n = 6, k = 4 and dmin = 3, how many errors can be corrected by
this code?
a. 0
b. 1
c. 2
d. 3
Answer: a
9.In a linear code, the minimum Hamming distance between any two code words is
______minimum weight of any non-zero code word.
a. Less than
b. Greater than
c. Equal to
Answer : c
10.Which among the following represents the code in which codewords consists of message bits
and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
Answer : b
11. Which among the following is/are the essential condition/s for a good error control coding
technique?
a. Faster coding & decoding methods
b. Better error correcting capability
c. Maximum transfer of information in bits/sec
d. All of the above
Answer : d
12. Hamming distance can be given by the number of elements in which

a. They are same
b. They differ
c. Which are non zero
d. None of the mentioned
Answer: b
13. Code strength is characterized by its

a. Minimum distance
b. Maximum distance
c. Code weight
d. Code size
Answer: a
14. The distance between two code-words is equal to the _____ of the third code-word which is
the sum of the first two code-words.
a. Size
b. Weight
c. Minimum distance
Answer: b
15. Error detecting capability is given as

a. Dmin + 1
b. Dmin -1
c. Dmin
d. Dmin/2
Answer: b
16. The cyclic codes are designed using
a. Shift registers with feedback
b. Shift registers without feedback
c. Flipflops
Answer: a
17. A cyclic code can be generated using

a. Generator polynomial
b. Generator matrix
c. Generator polynomial & matrix
Answer: a
18. The feedback shift register circuit is called as

a. Multiplying circuit
b. Dividing circuit
c. Feedback circuit
d. Shifting circuit
Answer: b
19. The received code contains an error if the syndrome vector is

a. Zero
b. Non zero
c. Infinity
Answer: b
20. Block codes are generated using

a. Generator polynomial
b. Generator matrix
c. Generator polynomial & matrix
Answer: b
21. Block length is the _____________ in the code word.
a. Number of elements
b. Distance between elements
c. Number of parity bits
Answer: a
22. The rate of a block code is the ratio of

a. Block length to message length
b. Message length to block length
c. Message weight to block length
Answer: b
23. Linear codes are used for

a. Forward error correction
b. Backward error correction
c. Forward error detection
d. Backward error detection
Answer: a
24. Syndrome is calculated by

a. HT/r
b. rHT
c. rH
Answer: b
25. Which are forward error correcting codes?

a .Block codes
b. Convolutional codes
c. Block & Convolutional codes
Answer: c
26. Information rate is defined as
a. Information per unit time
b. Average number of bits of information per second
c. rH
d. All of the above
Answer: d
27. The _____ of the code-word is the number of non zero elements.
a. Size
b. Weight
c. Distance
d. Subspace
Answer: b
28. Some examples of linear codes

a. Hamming code
b. Reed-Solomon code
c. Parity code
d. All of the mentioned
Answer: d
29. The measure of the amount of redundancy is given by

a. Code size
b. Code weight
c. Code rate
d. Minimum distance
Answer: c
30. The number of k bit shift over which a single information bit influences the encoder output is
given by
a. Code rate
b. Constraint length
c. Code length
d. Code weight
Answer: b
31. The method used for representing convolution encoder are
a. Connection pictorial
b. State diagram
c. Tree diagram
d. All of the mentioned
Answer: d
32. Code rate r, k information bits and n as total bits, is defined as

a. r = k/n
b. k = n/r
c. r = k * n
d. n = r * k
Answer: a
33. The information rate R for given average information H= 2.0 for analog signal band limited
to B Hz is
a. 8 B bits/sec
b. 4 B bits/sec
c. 2 B bits/sec
d. 16 B bits/sec
Answer : b
34.A linear code

a. Sum of code words is also a code word
b. All-zero code word is a code word
c. Minimum hamming distance between two code words is equal to weight of any non zero code
word
d. All of the above
Answer: d
35.In Viterbi's algorithm, the selected paths are regarded as __________

a. survivors
b. defenders
c. destroyers
d. carriers
ANSWER: a
36.In Viterbi's algorithm, which metric is adopted for decision making?
a. Hamming distance
b. Galois Field
c. Hamming bound
d. Parity-check
Answer : a
37.During the shifting of bits in an encoder, how are the transitions in the states represented?
a. By lines
b. By circles
c. By summers
d. By squares
Answer: a
38.At any given time, the output of an encoder depends on ______

a. Past input
b. Present input
c. Both a and b
Answer: c
39. In Trellis diagram, what do/does the horizontal axis represent/s?

a. Continuous time
b. Discrete time
c. Sampled time
d. All of the above
Answer: b
40. Number of shifts over which a single message bit can influence the encoder output is called
a. Code rate
b. Constraint length
c. Code vector
d. Information rate
Answer: b

Unit V DIGITAL COMMUNCATION R2017 MCQ

Uploaded by

Copyright:

Available Formats

You might also like

Unit V DIGITAL COMMUNCATION R2017 MCQ

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Unit V DIGITAL COMMUNCATION R2017 MCQ

Uploaded by

Copyright:

Available Formats

Unit V - Error Control Coding

2. For decoding in convolution coding, in a code tree,

3. The code in convolution coding is generated using

12. Hamming distance can be given by the number of elements in which

13. Code strength is characterized by its

15. Error detecting capability is given as

17. A cyclic code can be generated using

18. The feedback shift register circuit is called as

19. The received code contains an error if the syndrome vector is

20. Block codes are generated using

22. The rate of a block code is the ratio of

23. Linear codes are used for

24. Syndrome is calculated by

25. Which are forward error correcting codes?

28. Some examples of linear codes

29. The measure of the amount of redundancy is given by

32. Code rate r, k information bits and n as total bits, is defined as

34.A linear code

35.In Viterbi's algorithm, the selected paths are regarded as __________

38.At any given time, the output of an encoder depends on ______

39. In Trellis diagram, what do/does the horizontal axis represent/s?

You might also like