Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
DCC '03 Proceedings of the Conference on Data Compression
Restructuring ordered binary trees
Journal of Algorithms - Special issue: SODA 2000
Huffman codes and self-information
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
We show how, given a probability distribution P over a set of size n, in O(n) time we can construct an efficient data structure that stores a code with less than 3 bits redundancy, and takes o(n) bits of space when P consists of o(n/logn) runs of nearly equal probabilities.