Information Theory And Coding MCQ Questions & Answers | ECE

Home / Electronics And Communications Engineering / Information Theory And Coding

Section 1 Section 2

1.
Consider a binary memoryless channel characterized by the transition probability diagram shown in the figure. The channel is

A. Lossless

B. Noiseless

C. Useless

D. Deterministic

Answer & Solution Discuss in Board Save for Later

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

Answer & Solution Discuss in Board Save for Later

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

A. Soft Decision Decoding

B. Hard Decision Decoding

C. Both A and B

D. None of the above

Answer & Solution Discuss in Board Save for Later

4.
Binary Huffman coding is a

A. Prefix condition code

B. Suffix condition code

C. Prefix & Suffix condition code

D. None of the mentioned

Answer & Solution Discuss in Board Save for Later

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

A. Past output

B. Future output

C. Both A and B

D. None of the above

Answer & Solution Discuss in Board Save for Later

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.

Information Theory and Coding - Section 1