MAKE A MEME
View Large Image
| View Original: | Huffman tree.svg (850x460) | |||
| Download: | Original | Medium | Small | Thumb |
| Courtesy of: | commons.wikimedia.org | More Like This | ||
| Keywords: Huffman tree.svg Huffman tree generated from the exact frequencies in the sentence this is an example of a huffman tree It encodes this sentence in 135 bits as 01101010100010111111000101111101000101110001001001001111001111001000111001101 1011110101111010001111101110101110100010111011011000000000 representing about a 53 compression over ASCII's 288 bits not counting any space for representing the tree Notice that the frequencies on each level fall between two adjacent powers of 2 The bit pattern and frequency of each character are shown by the table below Notice that some symbols have different frequencies but the same encoding length; these particularly indicate places where arithmetic coding would do better own 2007-05-15 Dcoetzee <table><tr><td> wikitable Char Freq Code - space 7 111 - a 4 010 - e 4 000 - f 3 1101 - h 2 1010 - i 2 1000 </td><td> wikitable Char Freq Code - m 2 0111 - n 2 0010 - s 2 1011 - t 2 0110 - l 1 11001 - o 1 00110 </td><td valign top > wikitable Char Freq Code - p 1 10011 - r 1 11000 - u 1 00111 - x 1 10010 </td></tr></table> Huffman coding | ||||
