In source coding theorem if, discrete memoryless source of entropy H(S) and average code-word length \(\bar{L}\), the source coding theorem has ............... following relation.
MH SET - 2020, SET Exam - 2020,
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.
Please log in or register to report this question.