Pries: M467 - Information and Coding Theory, Spring 2013
Read: Roman 2.2, 3.1, 3.2, 3.4
Problems
1. What is the maximum number of codewords in an instantaneous binary code in (Z/2)5 ?
2. When will the Huffman encoding include a codeword of length 1? include two codewords of length 2?
3. Roman 2.2 #9.
1 1
4. Let P = { 12 , 14 , 18 , 16
, 16 }. Compare the average wordlength of the Huffman encoding
with the entropy.
5. Roman 3.1 #7,8,9.
6. How many source words do there need to be to force every uniquely decipherable binary
encoding to have average word length at least 5?
7. Extra credit: Roman 2.2 #7, 13, Roman 3.2 #6.