Suppose the symbols a, b, c, d, e occur with frequencies 1/2,1/4,1/8,1/16,1/16, respectively.
(a) What is the Huffman encoding of the alphabet?
(b) If this encoding is applied to a file consisting of 1,000,000 characters with the given frequencies, what is the length of the encoded file in bits?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.