Example Huffman encoding
		A = 0 B = 100 C = 1010 D = 1011 R = 11    ABRACADABRA = 01001101010010110100110 ¡ This is eleven letters in 23 bits ¡ A fixed-width encoding would require 3 bits for five different letters, or 33 bits for 11 letters ¡ Notice that the encoded bit string can be decoded!