This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: c) To answer this question, it is most intuitive if we describe k as follows k = 2 n + m, where m is an offset from a power of two. m is in the range 0 ≤ m ≤ 2 n We can draw the Huffman tree for a uniform source as follows: m # codewords of length n # codewords of length n+1 1 15 2 2 14 4 3 13 6 2 So we now can describe the average length of a Huffman codeword as follows: Average Length = Total Bits / number of symbols Efficiency = Entropy / Average Length 3...
View Full Document
- Fall '11
- Image processing, average length, John Villasenor, Ave. length