Re: huffman code question.....

pitter wrote: 
anyone can help ???

Suppose a data file contains a sequence of 8-bit characters such that all 256 characters are
about as 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.


Have you tried applying the Huffman encoding algorithm to the
source described above?

I'm not sure how rigurous a proof you want, but perhaps a key
detail that might help you prove it by induction (or something
"a la" mathematical induction) is the fact that for any two
characters in the set, it is true that the frequency of one
of them is less than twice the frequency of the other one.
This should allow you to see that for each branch of the
Huffman tree, you're not gaining anything.

(I know, the above is sketchy...  But you said "anyone can
help?", as opposed to "anyone can do it?"  :-))

HTH,

Carlos
--
.