Unformatted text preview: a) Provide a formula for the entropy (in bits) of this information source. Consider k in the range 2 n ≤ k ≤ 2 n+1 . As is customary, let H denote the entropy. Let L denote the actual average length of the Huffman code for this source. b) What is the minimum possible value of L-H, and for what value(s) of k will it occur in the range specified above? c) Provide a formula for the efficiency of the Huffman code with respect to the variables k and n....
View Full Document
- Spring '11
- arithmetic coding, huffman code, John Villasenor