ITCSolution3

Itcsolution3

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5. 36 Solution. (a) l = (1, 2, 2) can be the word lengths of a binary Huffman code, but l = (2, 2,3,3) (assume that l1 = 2, l2 = 2, l3 = 3, l4 = 3 ) cannot, because by the Huffman code construction procedure, we should always delete the second bit of l1 = 2 , so that l1 = 1 . (b) Assume the code C is on | χ |= M source symbols with probabilities p1 , p2 ,..., pM , and corresponding code lengths l1 , l2 ,..., lM . Assume that p1 ≥ p2 ≥ ... ≥ pM , and if pi = pi +1 = ... = pi + r , then li ≤ li +1 ≤ ... ≤ l...
View Full Document

This note was uploaded on 02/24/2011 for the course EE 634 taught by Professor Pados during the Spring '09 term at SUNY Buffalo.

Ask a homework question - tutors are online