A Sequential Algorithm for the Universal Coding of Finite Memory Sources

IEEE Transactions on Information Theory

Volumn 38, Issue 3, 1992, Pages 1002-1014

  Lempel, Abraham ^a   Ziv, Jacob ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Data compression; finite memory sources; state estimation; universal coding

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - ESTIMATION;

ARITHMETIC CODES; FINITE MEMORY SOURCES; UNIVERSAL CODING;

CODES, SYMBOLIC;

EID: 0026866314     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.135641     Document Type: Article

References (15)

1. N. Merhav, M. Gutman, and J. Ziv, “On the estimation of the order of a Markov chain and universal data compression,” IEEE Trans. Inform. Theory, vol. 35, pp. 1014–1019, Sept. 1989.
2. J. Ziv and N. Merhav, “Estimating the number of states of a finite-state source,” IEEE Trans. Inform. Theory, vol. 38, pp. 61–65, Jan. 1992.
3. J. Rissanen, “Complexity of strings in the class of Markov sources,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 526–532, July 1986.
4. J. Rissanen, “A universal data compression system,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 656–664, Sept. 1983.
5. J. Rissanen and G. G. Langdon Jr., “Universal Modeling and coding,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 12–13, Jan. 1981.
6. G. G. Langdon Jr and J. Rissanen, “Compression of black-white images with arithmetic coding,” IEEE Trans. Commun., vol. COM-29, pp. 858–867 June 1981.
7. L. D. Davisson, “Minimax noiseless universal coding for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 211–215, Mar. 1983.
8. L. D. Davisson, R. J. McEliece, M. B. Pursley, and M. S. Wallace, “Efficient universal noiseless source codes,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 269–279, May 1981.
9. A. Lempel and J. Ziv, “Compression of individual sequences via variable rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.
10. M. Gutman, “Asymptotically optimal classification for multiple tests with empirically observed statistics,” IEEE Trans. Inform. Theory, vol. 35, pp. 401-408, Mar. 1989.
11. P. Elias, “Universal codeword sets and representation of the integers,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, Mar. 1975.
12. Y. M. Shtar’kov, “Universal sequential coding of single messages,” Probl. Inform. Transm., vol. 24, pp. 175-186, 1988.
13. M. J. Weinberger, “Universal source coding and related topics,” D.Sc. dissert., Dept. of Elect. Eng., Technion-UT, Haifa, Israel, 1991.
14. R. Ash, Information Theory. New York: John Wiley, 1967
15. F. Jelinek, Probabilistic Information Theory. New York: McGraw-Hill, 1968.