SOFSEM
2010
Springer
13 years 8 months 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...