Comparison between universal data-compression algorithms applied to Markov sources
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A sequential algorithm for the universal coding of finite memory sourcesIEEE Transactions on Information Theory, 1992
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithmIEEE Transactions on Information Theory, 1992
- Complexity of strings in the class of Markov sourcesIEEE Transactions on Information Theory, 1986
- Minimax noiseless universal coding for Markov sourcesIEEE Transactions on Information Theory, 1983
- Efficient universal noiseless source codesIEEE Transactions on Information Theory, 1981
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978