MULTIMEDIA AND QUALITY OF SERVICE
COMPRESSION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) = 0.4, P(B)= 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is
|
|
A = 0 B = 111 C = 110 D = 10
|
|
|
A = 0 B = 11 C = 10 D = 111
|
|
|
A = 0 B = 111 C = 11 D = 101
|
|
|
A = 01 B = 111 C = 110 D = 10
|
Explanation:
Detailed explanation-1: -probabilities are negative powers of two. l = 0.4 × 1 + 0.2 × 2 + 0.2 × 3 + 0.1 × 4 + 0.1 × 4 = 2.2 bits/symbol. The entropy is around 2.13. Thus, the redundancy is around 0.07 bits/symbol.
Detailed explanation-2: -Huffman Coding is a famous Greedy Algorithm. It is used for the lossless compression of data. It uses variable length encoding.
Detailed explanation-3: -This is the basic idea behind Huffman coding: to use fewer bits for characters that occur more frequently.
There is 1 question to complete.