Information Theory And Coding MCQ

Test your knowledge with important Information Theory And Coding MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Information Theory And Coding MCQs at Bissoy

• For (n, k) binary BCH code, how are the parity check bits (n - k) specified?
  ক

  m + t_c

  খ

  m - t_c

  গ

  mt_c

  ঘ

  $$\frac{m}{{{t_c}}}$$
• Which among the following represents the code in which codewords consists of message bits and parity bits separately?
  ক

  Block Codes

  খ

  Systematic Codes

  গ

  Code Rate

  ঘ

  Hamming Distance
• Four messages band limited to W, W, 2W and 3W respectively are to be multiplexed using Time Division Multiplexing (TDM). The minimum bandwidth required for transmission of this TDM signal is
  ক

  W

  খ

  3W

  গ

  6W

  ঘ

  7W
• For designing a communication system, which among the following parameters should be maximum?<br>1. Transmission rate<br>2. Received signal-to-noise ratio<br>3. Error probability<br>4. Bandwidth requirement
  ক

  1 and 2

  খ

  3 and 4

  গ

  1 and 3

  ঘ

  2 and 4
• An image uses 512 × 512 picture elements. Each of the picture elements can take any of the 8 distinguishable intensity levels. The maximum entropy in the above image will be
  ক

  2097152 bits

  খ

  786432 bits

  গ

  648 bits

  ঘ

  144 bits
• In a Direct Sequence CDMA system the chip rate is 1.2288 × 106 chips per second. If the processing gain is desired to be AT LEAST 100, the data rate
  ক

  Must be less than or equal to 12.288 × 10 bits per second

  খ

  Must be greater than 12.288 × 10³ bits per second

  গ

  Must be exactly equal to 12.288 × 10³ bits per second

  ঘ

  Can take any value less than 122.88 × 10³ bits per second
• During the shifting of bits in an encoder, how are the transitions in the states represented?
  ক

  By lines

  খ

  By circles

  গ

  By summers

  ঘ

  By squares
• I-frame is
  ক

  It basically searches the frames

  খ

  It basically predicts the movement of objects

  গ

  It basically compress the movement of objects

  ঘ

  None of the above
• Huffman coding technique is adopted for constructing the source code with . . . . . . . . redundancy.
  ক

  Maximum

  খ

  Constant

  গ

  Minimum

  ঘ

  Unpredictable
• A source alphabet consists of N symbols with the probability of the first two symbols being the same. A source encoder increases the probability of the first symbol by a small amount ε and decreases that of the second by ε. After encoding, the entropy of the source
  ক

  Increases

  খ

  Remains the same

  গ

  Increases only if N = 2

  ঘ

  Decreases
• In Frame Check Sequence (FCS), which code is used if character length is 6 bit and generates 12 bit parity check bits?
  ক

  CRC-12

  খ

  CRC-16

  গ

  CRC-32

  ঘ

  CRC-CCITT
• Assuming that the channel is noiseless, if TV channels are 8 kHz wide with the bits/sample = 3Hz and signalling rate = 16 × 10⁶ samples/second, then what would be the value of data rate?
  ক

  16 Mbps

  খ

  24 Mbps

  গ

  48 Mbps

  ঘ

  64 Mbps
• Which lossy method for audio compression is responsible for encoding the difference between two consecutive samples?
  ক

  Silence Compression

  খ

  Linear Predictive Coding (LPC)

  গ

  Adaptive Differential Pulse Code modulation (ADPCM)

  ঘ

  Code Excited Linear Predictor (CELP)
• Types of compression
  ক

  Lossless

  খ

  Lossy

  গ

  Both A and B

  ঘ

  None of the above
• In sphere packing, where is the received code vector with added noise located?
  ক

  Inside the sphere

  খ

  Outside the sphere

  গ

  On the boundary (circumference) of sph

  ঘ

  All of the above
• For designing trellis code, the emphasis must be on maximizing . . . . . . . .
  ক

  Euclidean distance between code vectors

  খ

  Hamming distance of error correcting codes

  গ

  Both A and B

  ঘ

  None of the above
• In register contents at decoder, the syndrome register consists of syndrome after all bits of received vector are clocked into the decoder . . . . . . . .
  ক

  Input

  খ

  Output

  গ

  Both A and B

  ঘ

  None of the above
• MPEG coders are used for
  ক

  Compression of audio

  খ

  Compression of text

  গ

  Compression of audio and video

  ঘ

  None of the above
• Which bitmap file format/s support/s the Run Length Encoding (RLE)?
  ক

  TIFF

  খ

  BMP

  গ

  PCX

  ঘ

  All of the above
• In a linear code, the minimum Hamming distance between any two code words is . . . . . . . . minimum weight of any non-zero code word.
  ক

  Less than

  খ

  Greater than

  গ

  Equal to

  ঘ

  None of the above
• In Viterbi's algorithm, the selected paths are regarded as . . . . . . . .
  ক

  Survivors

  খ

  Defenders

  গ

  Destroyers

  ঘ

  Carriers
• For fixed symbol rate, increase in bits/symbol ultimately improves rb/B bits/s/Hz &amp; hence, regarded as . . . . . . . .
  ক

  Power efficiency

  খ

  Spectral efficiency

  গ

  Transmission efficiency

  ঘ

  Modulation eficiency
• In channel coding theorem, channel capacity decides the . . . . . . . . permissible rate at which error free transmission is possible.
  ক

  Maximum

  খ

  Minimum

  গ

  Constant

  ঘ

  None of the above
• The capacity of a band-limited additive white Gaussian noise (AWGN) channel is given by $$C = W\,{\log _2}\left( {1 + \frac{P}{{{\sigma ^2}W}}} \right)$$     bits per second (bps), where W is the channel bandwidth, P is the average power received and σ² is the one-sided power spectral density of the AWGN. For a fixed $$\frac{P}{{{\sigma ^2}}} = 1000,$$   the channel capacity (in kbps) with infinite bandwidth (W → ∞) is approximately
  ক

  1.44

  খ

  1.08

  গ

  0.72

  ঘ

  0.36
• Which coding technique/s exhibit/s the usability of fixed length codes?
  ক

  Lempel Ziv

  খ

  Huffman

  গ

  Both A and B

  ঘ

  None of the above
• Generally, a primitive polynomial of degree 'm' is an irreducible polynomial in such a way that it is a factor of xⁿ + 1, where 'n' = . . . . . . . .
  ক

  2^m - 1

  খ

  $$\frac{m}{n} - 1$$

  গ

  $$\frac{{\left( {m + 1} \right)}}{2}$$

  ঘ

  m - n - 1
• A memoryless source emits n symbols each with a probability p. The entropy of the source as a function of n
  ক

  Increases as logn

  খ

  Decreases as $$\log \left( {\frac{1}{n}} \right)$$

  গ

  Increases as n

  ঘ

  Increases as nlogn
• A linear Hamming code is used to map 4-bit messages to 7-bit codewords. The encoder mapping is linear. If the message 0001 is mapped to the codeword 0000111, and the message 0011 is mapped to the codeword 1100110, then the message 0010 is mapped to
  ক

  0010011

  খ

  1111111

  গ

  1111000

  ঘ

  1100001
• According to linearity property, the. . . . . . . . of two code words in a cyclic code is also a valid code word.
  ক

  Sum

  খ

  Difference

  গ

  Product

  ঘ

  Division
• In Repetition Code, how many information bit/s is/are present in addition to n-1 parity bits?
  ক

  One

  খ

  Two

  গ

  Four

  ঘ

  Eight