Nonlinear Sciences – Adaptation and Self-Organizing Systems
Scientific paper
1993-03-05
Nonlinear Sciences
Adaptation and Self-Organizing Systems
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
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.
Profile ID: LFWR-SCP-O-394884