Contents

1 More easy, impossible!

• It is a particular case of the Huffman code where the number of bits of each code-word (minus one) is equal to the index of the symbol in the source alphabet. Example:

  $s$	Code
  0	0
  1	10
  2	110
  3	1110
  4	11110
  5	111110
  6	1111110
  7	11111110
  8	111111110

• The unary coding is only optimal when (see Equation ??)

  $$p\left(s\right)=2^{-\left(s+1\right)}$$

  (Eq:Unary)

  where $s=0,1,\cdots$.

Let’s go the the lab!

1. make unary.
2.                     Codec | lena boats pepers zelda Average  
   --------------------------+--------------------------------  
                           : |    :     :      :     :       :  
                       unary | ....  ....   ....  ....    ....  
               tpt 1 | unary | ....  ....   ....  ....    ....