MULTIMEDIA AND QUALITY OF SERVICE
COMPRESSION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
A Huffman code:A = 1, B = 000, C = 001, D = 01, P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average codeword length is
|
|
6
|
|
|
3.1
|
|
|
5.2
|
|
|
2.1
|
Explanation:
Detailed explanation-1: -A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of : 2.40.
Detailed explanation-2: -The Huffman code is a length-limited code. The maximum code length for a symbol is 16 bits. The Huffman code is a canonical code.
Detailed explanation-3: -Huffman Coding is a famous Greedy Algorithm. It is used for the lossless compression of data. It uses variable length encoding.
There is 1 question to complete.