6 4 I1S1 11 E5 2 N1 3 Sp3 2 V1Y1 R2 7 18 EVERY EGG IS GREEN Use this Huffman tree to code the sentence: 100100100110101001011111100110101101100111 01110101100
Huffman: EVERY EGG IS GREEN ASCII: 0100010101010110010001010101001001011001 0010000001000101010001110100011100100000 0100100101010011001000000100011101010010 010001010100010101001110
What is the per cent of saving in space when Huffman is used instead of ASCII? ASCII: 18 characters at 1 byte each = 144 bits Huffman: 53 bits Improvement: 144-53 = 91 bits less 91/144 *100 = 62% less space used
Your consent to our cookies if you continue to use this website.