ITCSolution3

li r the word length l l1 l2 of a binary

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: i + r . The word length l = (l1 , l2 ,...) of a binary Huffman code should satisfy the following conditions: 1. If p j > pk , then l j ≤ lk ; 2. lM −1 = lM ; 3. Among all code words with length lM , there are at least two that are the same everywhere except at the last digit. 4. For example, if M = 4 ,then we have the following cases: a. p1 > p2 ≥ p3 + p4 In this case, we should have l4 = l3 = l2 + 1 = l1 + 1 . b. p1 = p2 = p3 + p4 In this case we may have l4 = l3 = l2 + 1 = l1 + 1 or l1 = l2 = l3 = l4 . c. p1 = p2 = p3 = p4 In this case we should have l1 = l2 = l3 = l4 ....
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