ITC quiz

The unit of average mutual information is

• Bits

• Bytes

• Bits per symbol

• Bytes per symbol

Binary Huffman coding is a

• Prefix condition code

• Suffix condition code

• Prefix & Suffix condition code

• None of the mentioned

The event with minimum probability has least number of bits.

• True

• False

Lempel-Ziv coding uses

• fixed length codes

• variable length codes

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

• 1 - H(P)

• H(P) - 1

• 1 - H(P)²

• H(P)² - 1

A communication channel with AWGN operating at SNR>>1 and bandwidth B has capacity C₁. If SNR is doubled keeping B constant, the resultant capacity C₂ is given by

1. Consider the following codes:

2. 1. Hamming code

3. 2. Huffman code

4. 3. Shannon-Fano code

5. 4. Convolution code

6. Which of these are source codes?

• • 
    1 and 2 only

• 2 and 3 only

• • 3 and 4 only

• 1, 2, 3 and 4

For a (6,4) block code where n = 6, k = 4 and d_min = 3, how many errors can be corrected by this code?

• 0

• 1

• 2

• 3

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

• Equal to

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