Universal Data Compression and Repetition Times

IEEE Transactions on Information Theory

Volumn 35, Issue 1, 1989, Pages 54-58

  Willems, Frans M J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84941434809     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.42176     Document Type: Article

References (10)

1. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
2. P. Elias, “Interval and recency rank source coding: Two Online adaptive variablElength schemes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 3-10, Jan. 1987.
3. M. Kac, “On the notion of recurrence in discrete stochastic processes,” Bull. Amer. Math. Soc, vol. 53, pp. 1002-1010, Oct. 1947.
4. L. D. Davisson, “Universal noiseless coding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
5. R. G. Gallager, “Variations on a theme by Huffman,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, Nov. 1978.
6. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, May 1977.
7. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.
8. J. L. Bentley, D. D. Sleator, R. E. Tarjan, and V. K. Wei, “A locally adaptive data compression scheme,” Commun. Ass. Comput. Mach., vol. 29, pp. 320-330, April 1986.
9. J. Rissanen, “Universal coding, information, prediction, and estimation,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, July 1984.
10. J. L. Massey, “The entropy of a rooted tree with probabilities,” presented at the IEEE Int. Symp. Inform. Theory, St. Jovite, Canada, Sept. 26-30, 1983.