The length of a typical Huffman codeword
R. Schack
Abstract
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.
Create a lesson
Related papers
Amplifying Phenomenal Information: Toward a Fundamental Theory of Consciousness
L. Gabora
Cumulant Dynamics of a Population under Multiplicative Selection, Mutation and Drift
Magnus Rattray, Jonathan L. Shapiro
A microsimulation of traders activity in the stock market: the role of heterogeneity, agents' interactions and trade frictions
Giulia Iori
Number-conserving cellular automaton rules
Nino Boccara, Henryk Fuks
The Importance of Being Discrete - Life Always Wins on the Surface
Nadav M. Shnerb, Yoram Louzoun, Eldad Bettelheim et al.
Fitness versus Longevity in Age-Structured Population Dynamics
W. Hwang, P. L. Krapivsky, S. Redner