and 5 others joined a min ago.
0
6.9kviews
Adaptive Huffman coding:
1 Answer
1
123views
written 7.2 years ago by
teamques10
★ 65k
|
In adaptive Huffman coding both the compression and the decompression start with an empty Huffman tree.
No symbols are assigned codes and every new symbol is treated as a leaf node with the same weight.
As new symbols are added, the tree is also updated such that the updated tree …
and 2 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.