71. 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' = . . . . . . . .
72. Which coding technique/s exhibit/s the usability of fixed length codes?
73. 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 σ2 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
74. In channel coding theorem, channel capacity decides the . . . . . . . . permissible rate at which error free transmission is possible.
75. When the base of the logarithm is e, the unit of measure of information is
76. For fixed symbol rate, increase in bits/symbol ultimately improves rb/B bits/s/Hz & hence, regarded as . . . . . . . .
77. In Viterbi's algorithm, the selected paths are regarded as . . . . . . . .
78. In a linear code, the minimum Hamming distance between any two code words is . . . . . . . . minimum weight of any non-zero code word.
79. Which bitmap file format/s support/s the Run Length Encoding (RLE)?
80. Self information should be
Read More Section(Information Theory and Coding)
Each Section contains maximum 100 MCQs question on Information Theory and Coding. To get more questions visit other sections.