Vidyalelo
ECE · all questions

Information Theory And Coding
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

232

Questions

6/12

Page

Pick an option on a question to see the right answer and solution.

Consider a binary memoryless channel characterized by the transition probability diagram shown in the figure. The channel is
Information Theory and Coding mcq question image

Select an option to see the answer and solution.

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 . . . . . . . .

Select an option to see the answer and solution.

For a received sequence of 6 bits, which decoding mechanism deals with the selection of best correlated sequence especially by correlating the received sequence and all permissible sequences?

Select an option to see the answer and solution.

Binary Huffman coding is a

Select an option to see the answer and solution.

In discrete memoryless source, the current letter produced by a source is statistically independent of . . . . . . . .

Select an option to see the answer and solution.

The capacity of a binary symmetric channel, given H(P) is binary entropy function is

Select an option to see the answer and solution.

When the channel is noisy, producing a conditional probability of error p = 0.5; the channel capacity and entropy function would be, respectively.

Select an option to see the answer and solution.

A source generates three symbol m0, m1, m2 with probabilities 0.5, 0.25, 0.5, then find entropy?

Select an option to see the answer and solution.

Shannon's law relates which of the following?

Select an option to see the answer and solution.

A source produce 26 symbols with equal probability. What is the average information produced by this source?

Select an option to see the answer and solution.

A discrete memory less source has two symbols x1 and x2 with probabilities p(x1) and p(x2) respectively, then the entropy of the source H(X) is

Select an option to see the answer and solution.

Capacity of each channel in FDMA is given by

Select an option to see the answer and solution.

The channel capacity under the Gaussian noise environment for a discrete memory less channel with a bandwidth of 4 MHz and SNR of 31 is.

Select an option to see the answer and solution.

Conveniently information I(x) is expressed as:

Select an option to see the answer and solution.

Match List-I with List-II and select the correct answer using the options given below the lists:
List-I List-II
a. Entropy coding 1. McMillan's Rule
b. Channel capacity 2. Redundancy
c. Minimum length code 3. Shannon Fano
d. Equivocation 4. Shannon law

Select an option to see the answer and solution.

Find the channel capacity (in MHz), if the channel bandwidth is 20MHz having signal to noise ratio 1023dB?

Select an option to see the answer and solution.

Consider a noisy binary channel with bit error probability pe = 5 × 10-5. Assume 10000 bits are being transmitted over such a channel. The probability that there will be 2 or less number of bits in error is

Select an option to see the answer and solution.

A communication channel with AWGN operating at a signal to noise ratio SNR >> 1 and bandwidth B has capacity C1. If the SNR is doubled keeping B constant, the resulting capacity C2 is given by

Select an option to see the answer and solution.

An event has two possible outcomes with probability    The rate of information with 16 outcomes per second is:

Select an option to see the answer and solution.

An analog signal is band limited to 4 kHz. It is sampled at the Nyquist rate and samples are quantized into 4 levels. The quantization levels have probabilities  and  The information rate of the source is:

Select an option to see the answer and solution.