On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources

IEEE Transactions on Information Theory

Volumn 43, Issue 4, 1997, Pages 1101-1111

  Yang, En Hui ^b   Kieffer, John C ^a,c  

^a IEEE

^b NANKAI UNIVERSITY   (China)

^c University of Minnesota   (United States)

Author keywords

mixing sources; Data compression; Fixed database Lempel Ziv algorithm; Shannon entropy rate; Variable length to variable length codes

Indexed keywords

ALGORITHMS; DATA COMPRESSION; ENCODING (SYMBOLS); MARKOV PROCESSES; REDUNDANCY;

FIXED DATABASE LEMPEL-ZIV ALGORITHM; SHANNON ENTROPY RATE;

DATABASE SYSTEMS;

EID: 0031190761     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.605570     Document Type: Article

References (17)

1. P. Billingsley, Convergence of Probability Measures. New York: Wiley, 1968.
2. R. M. Gray and J. C. Kieffer, "Asymptotically mean stationary measures," Ann. Probab., vol. 8, pp. 962-973, Oct. 1980.
3. D. R. Halverson and G. L. Wise, "Discrete-time detection in φ-mixing noise," IEEE Trans. Inform. Theory, vol. IT-26, pp. 189-198, 1980.
4. F. Jelinek and S. K. Schneider, "On variable length-to-block coding," IEEE Trans. Inform. Theory, vol. IT-18, pp. 765-774, 1972.
5. J. C. Kieffer and J. G. Dunham, "Variable-length to variable-length encoders are asymptotically mean stationary," in Proc. 18th Allerton Conf. on Communication, Control and Computers, Oct. 1980, pp. 438-439.
6. J. C. Kieffer and M. Rahe, "The pointwise ergodic theorem for transformations whose orbits contain or are contained in the orbits of a measure-preserving transformation," Canadian J. Math., vol. 34, pp. 1303-1318, 1982.
7. J. C. Kieffer, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, 1991.
8. R. E. Krichevskii and V. K. Trofimov, "The performance of universal encoding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 199-207, 1981.
9. G. Louchard and W. Szpankowski, "On the average redundancy rate of the Lempel-Ziv code," IEEE Trans. Inform. Theory, vol. 43, pp. 2-8, Jan. 1997.
10. W. Szpankowski, "A generalized suffix tree and its (un)expected asymptotic behaviors," SIAM J. Comp., vol. 22, pp. 1176-1198, 1993.
11. A. D. Wyner and A. J. Wyner, "Improved redundancy of a version of the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 41, pp. 723-731, 1995.
12. A. D. Wyner and J. Ziv, "Fixed data base version of the Lempel-Ziv data compression algorithm," IEEE Trans. Inform. Theory, vol. 37, pp. 878-880, 1991.
13. A. J. Wyner, "The redundancy and distribution of phrase lengths of the FDLZ algorithm," in Proc. 1994 IEEE Int. Symp. on Information Theory (Trondheim, Norway), p. 8.
14. E.-H. Yang and S. Shen, "Chaitin complexity, Shannon information content of a single event and infinite random sequences (I)," Sci. in China (Ser. A), vol. 34, pp. 1183-1193, 1991.
15. Z. Zhang and E.-H. Yang, "An on-line universal lossy data compression algorithm by continuous codebook refinement - Part II: Optimality for phi-mixing source models," IEEE Trans. Inform. Theory, vol. 42, pp. 822-836, 1996.
16. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
17. _, "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.