Text Compression Based on Variable-to-Fixed Codes for Markov Sources
DCC '00 Proceedings of the Conference on Data Compression
Improved Variable-to-Fixed Length Codes
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Efficient implementation of the generalized Tunstall code generation algorithm
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Tunstall code, Khodak variations, and random walks
IEEE Transactions on Information Theory
Source Coding: Part I of Fundamentals of Source and Video Coding
Foundations and Trends in Signal Processing
Information Processing and Management: an International Journal
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.90 |
Tunstall codes are variable-to-fixed length codes that maximize the expected number of source letters per dictionary string for discrete, memoryless sources. We analyze a generalization of Tunstall coding to sources with memory and demonstrate that as the dictionary size increases, the number of code letters per source symbol comes arbitrarily close to the minimum among all variable-to-fixed length codes of the same size. We also find the asymptotic relationship between the dictionary size and the average length of a dictionary entry