Minimax Noiseless Universal Coding for Markov Sources

IEEE Transactions on Information Theory

Volumn 29, Issue 2, 1983, Pages 211-215

  Davisson, Lee D ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0020721990     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1983.1056652     Document Type: Article

References (8)

1. L.D. Davisson, “Universal noiseless coding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 783–795, 1973.
2. R.E. Krichevsky and V.K. Trofimov, “The performance of universal encoding,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 199–207, 1981.
3. R.J. McEliece, M.B. Pursley, and M.S. Wallace, “Universal noiseless data compression for Markov sources,” in Proc. 1980 Conf. Information Sciences and Systems, pp. 164–167, 1980.
4. A.C. Blumer, R.J. McEliece, M.B. Pursley, and M.S. Wallace, “Universal source coding for Markov sources,” presented at Int. Symp. Information Theory, Santa Monica, CA, Feb. 9–12, 1981.
5. L.D. Davisson, G. Longo, and A. Sgarro, “The error exponent for the noiseless encoding of finite ergodic Markov sources,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 431–438, July 1981.
6. E. Parzen, Stochastic Processes. San Francisco, CA: Holden Day, 1962, pp. 324.
7. V.K. Trofimov, “The redundancy of Markov source coding,” Probl. Inform. Trans., vol. 10, pp. 16–24, 1974.
8. Yu. M. Starkov, “The coding of finite messages on output of a source with unknown statistics,” in Proc. V. Conf. Information Theory, pp. 147–152, 1972.