Text Compression Based on Variable-to-Fixed Codes for Markov Sources
DCC '00 Proceedings of the Conference on Data Compression
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
Word-valued sources: an ergodic theorem, an AEP, and the conservation of entropy
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
For a large class of parsing rules, we introduce a “conservation of entropy” theorem for the output of a unifilar Markov source. Using this theorem and renewal theory, we find a procedure to generate asymptotically optimal generalized variable-to-fixed length codes