Your Answer : (Not Answered)

Correct Answer : B

The source coding theorem states \(\bar{L} \geq H(S)\).

Shannon's source coding theorem says that the average codeword length of any uniquely decodable code for a discrete memoryless source cannot be less than the source entropy (in bits when binary codes are used). The entropy is the lower bound, which efficient codes such as Huffman codes approach.

\(\bar{L} \leq H(S)\) reverses the bound. The forms with log H(S) take a logarithm of the entropy, which is already a logarithmic measure, so they are not the theorem.

Your Answer : (Not Answered)

Correct Answer : C

CRC and Hamming code work on data of any size and fixed size respectively.

A cyclic redundancy check divides the whole message, of any length, by a generator polynomial and appends the remainder, so it can protect frames of arbitrary size. A Hamming code is a block code: a fixed number of data bits (for example 4 in the (7,4) code) is combined with a fixed number of parity bits, so it works on fixed-size blocks.

The options with 8-bit, 2-bit or fixed size for CRC reverse or misstate this.