Question: Suppose that a data file contains a sequence of 8-bit characters such that all 256 characters are about equally common: the maximum character frequency is
Suppose that a data file contains a sequence of 8-bit characters such that all 256 characters are about equally common: the maximum character frequency is less than twice the minimum character frequency. Prove that Huffman coding in this case is no more efficient than using an ordinary 8-bit fixed-length code.
Step by Step Solution
3.51 Rating (158 Votes )
There are 3 Steps involved in it
For any 22 characters the sum of their frequencies exceeds the frequency of any other char... View full answer
Get step-by-step solutions from verified subject matter experts
