A sequential algorithm for the universal coding of finite memory sources
- 1 May 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 38 (3) , 1002-1014
- https://doi.org/10.1109/18.135641
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Estimating the number of states of a finite-state sourceIEEE Transactions on Information Theory, 1992
- Asymptotically optimal classification for multiple tests with empirically observed statisticsIEEE Transactions on Information Theory, 1989
- On the estimation of the order of a Markov chain and universal data compressionIEEE Transactions on Information Theory, 1989
- Complexity of strings in the class of Markov sourcesIEEE Transactions on Information Theory, 1986
- A universal data compression systemIEEE Transactions on Information Theory, 1983
- Minimax noiseless universal coding for Markov sourcesIEEE Transactions on Information Theory, 1983
- Compression of Black-White Images with Arithmetic CodingIEEE Transactions on Communications, 1981
- Efficient universal noiseless source codesIEEE Transactions on Information Theory, 1981
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975