Suppose we have a Huffman tree for an alphabet of
symbols, and that the relative frequencies of the symbols are
1, 2, 4, ..., 2ⁿ⁻¹
. Sketch the tree for
n = 5
n = 10
. In such a tree (for general
) how many bits are required to encode the most frequent symbol? the least frequent symbol?
There are no comments yet.
You must log in to post a comment.Login