MULTIMEDIA AND QUALITY OF SERVICE
COMPRESSION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
In dictionary techniques for data compaction, which approach of building dictionary is used for the prior knowledge of probability of the frequently occurring patterns?
|
|
Adaptive dictionary
|
|
|
Static dictionary
|
|
|
Both
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -Dictionary-based coding techniques replace input strings with a code to an entry in a dictionary. The most well known dictionary-based techniques are Lempel-Ziv Algorithms (Ziv and Lempel, 1977, 1978) and their variants (Storer and Szymanski, 1982; Welch, 1984).
Detailed explanation-2: -Huffman coding is a more sophisticated technique for constructing variable-length prefix codes. The Huffman coding algorithm takes as input the frequencies that the code words should have, and constructs a prefix code that minimizes the weighted average of the code word lengths.
Detailed explanation-3: -Explanation: ASCII code is a fixed length code.
There is 1 question to complete.