Variable to fixed-length codes for Markov Sources
IEEE Transactions on Information Theory
Limiting distributions for the costs of partial match retrievals in multidimensional tries
Proceedings of the ninth international conference on on Random structures and algorithms
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Universal Compression and Retrieval
Universal Compression and Retrieval
Variable to Fixed Length Codes for Predictable Sources
DCC '98 Proceedings of the Conference on Data Compression
Generalized Tunstall codes for sources with memory
IEEE Transactions on Information Theory
Asymptotic average redundancy of Huffman (and other) block codes
IEEE Transactions on Information Theory
Universal variable-to-fixed length source codes
IEEE Transactions on Information Theory
Markov types and minimax redundancy for Markov sources
IEEE Transactions on Information Theory
Precise minimax redundancy and regret
IEEE Transactions on Information Theory
A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes
IEEE Transactions on Information Theory
An algorithm for compression of bilevel images
IEEE Transactions on Image Processing
Renewal theory in the analysis of tries and strings
Theoretical Computer Science
A master theorem for discrete divide and conquer recurrences
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A Master Theorem for Discrete Divide and Conquer Recurrences
Journal of the ACM (JACM)
| Hi-index | 754.84 |
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, designed variable-to-fixed length codes for memoryless sources that are optimal under certain constraints. In this paper, we study the Tunstall and Khodak codes using variety of techniques ranging from stopping times for sums of independent random variables to Tauberian theorems and Mellin transform. After proposing an algebraic characterization of the Tunstall and Khodak codes, we present new results on the variance and a central limit theorem for dictionary phrase lengths. This analysis also provides a new argument for obtaining asymptotic results about the mean dictionary phrase length and average redundancy rates.