Huffman coding

• Huffman coding used for actual binary representation of data
• Statistical based encoding - common pairs have short binary representations (eg. (0,1) -> 00, (1,2) -> 11011)
• Amplitudes (eg. -1) encoded straight
• Unusual codes (13,6) etc. encoded as long escape sequences, poor for compression
• Huffman coding for
  (2,3) (1,2)(-2) (0,1)(-1) (0,1)(-1) (0,1)(0,1) (2,1)(-1) (0,0)
  is
  0111111011010000000001110001010
• 31 bits required to encoded information in original 512 bit sample
• Compression ratio 16.5:1