The length of a typical Huffman codeword

Nonlinear Sciences – Adaptation and Self-Organizing Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, LATEX

Scientific paper

If p is the probability of a letter of a memoryless source, the length l of
the corresponding binary Huffman codeword can be very different from the value
-log p. We show that, nevertheless, for a typical letter, l is approximately
equal to -log p. More precisely, the probability that l differs from -log p by
more than m decreases exponentially with m.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The length of a typical Huffman codeword does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The length of a typical Huffman codeword, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The length of a typical Huffman codeword will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-394884

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.