Huffman Coding Exercise 2

Huffman Coding

Exercise 2.3 Construct a binary Huffinan code for a source with probabilities p, = 0.4, 0.3, 0.1, 0.1, 0.06, 0.04 , 
and find its average word-length. To what extent are the code, the word-lengths, and the average word-length unique? 
Exercise 2.7 Find binary and ternary Huffman codes for a source with probabilities p, = 0.3, 0.2, 0.15, 0.1, 0.1, 0.08, 0.05, 0.02. Find the average word-length in each case. 
Exercise 2.9 
Let S be the source in Examples 2.11 and 2.12. Find the probability distri-bution for S3, and show that a binary Huffman code C3 for S3 has average word-length Ls = L(C3) = 76/27.