Huffman encoding fails to do any compression for File1
Let's consider two files named File1 and File2. Inside these files, there are only four symbols, the symbols A, C, G and T, mixed and repetitive. We know how many times each of these symbols occurs. We want to use Huffman encoding to compress these files.
a) Huffman encoding fails to do any compression for File1. In this case, what would be the frequency of occurrence of symbols A, C, G and T in File1? (You can give any frequency distribution that results in zero compression.) In the example you gave, apply Huffman coding and show that there is no compression at all.
b) Is it possible to compress more than 50% with Huffman encoding for a file containing only 4 different symbols? Why? Briefly explain your answer.
Step by step
Solved in 3 steps with 1 images
