Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Text Compression Based on Variable-to-Fixed Codes for Markov Sources
DCC '00 Proceedings of the Conference on Data Compression
Generalized Tunstall codes for sources with memory
IEEE Transactions on Information Theory
Variable-to-fixed length codes and the conservation of entropy
IEEE Transactions on Information Theory
Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources
IEEE Transactions on Information Theory
On the Construction of (Explicit) Khodak's Code and Its Analysis
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, including Markov sources, which require a (suboptimal) generalization of Tunstall's algorithm proposed by Savari and analytically examined by Tabus and Rissanen. In general, if n is the total number of output leaves across all Tunstall trees, s is the number of trees (states), and D is the number of leaves of each internal node, then this method takes O((1 + (log s)/D)n) time and O(n) space.