136
Voted
SOFSEM
2010
Springer
15 years 17 days ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...