Redundancy of the Lempel-Ziv incremental parsing rule

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 9-21

  Savari, Serap A ^a,b  

^a NOKIA RESEARCH CENTER   (United States)

^b IEEE   (United States)

Author keywords

Lempel Ziv codes; Markov sources; Renewal theory; Unifilar sources

Indexed keywords

CODES (SYMBOLS); ENCODING (SYMBOLS); INFORMATION THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; REDUNDANCY;

LEMPEL ZIV CODES; MARKOV SOURCES; RENEWAL THEORY; UNIFILAR SOURCES;

DATA COMPRESSION;

EID: 0030736448     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567642     Document Type: Article

References (22)

1. J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inform, Theory, vol. IT-24, pp. 530-536, 1978.
2. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
3. R. Ash, Information Theory New York: Wiley, 1965.
4. E. Plotnik, M. J. Weinberger, and J. Ziv, "Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 38, pp. 66-72, 1992.
5. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 623-656, 1948.
6. D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, 1952.
7. B. P. Tunstall, "Synthesis of noiseless compression codes," Ph.D. dissertation, Georgia Inst. Technol., Atlanta, GA, 1967.
8. S. A. Savari, "Variable-to-fixed length codes for sources with known and unknown memory," Ph.D. dissertation, MIT, Cambridge, MA, 1996.
9. S. A. Savari and R. G. Gallager, "Arithmetic coding for finite-state noiseless channels," IEEE Trans. Inform. Theory, vol. 40, pp. 100-107, 1994.
10. R. G. Gallager, "Variations on a theme by Huffman," IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, 1978.
11. J. Rissanen, "Complexity of strings in the class of Markov sources," IEEE Trans. Inform. Theory, vol. IT-32, pp. 526-532, 1986.
12. J. Ziv and A. Lempel, "A universal algorithm for data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
13. T. A. Welch, "A technique for high-performance data compression," IEEE Computer, vol. 17, no. 6, pp. 8-19, 1984.
14. V. S. Miller and M. N. Wegman, "Variations on a theme by Ziv and Lempel," in Combinatorial Algorithms on Words, vol. F12, (NATO ASI Series), A. Apostolico and Z. Galil, Eds. Berlin, Germany: Springer-Verlag, 1985, pp. 131-140.
15. R. G. Gallager, personal communication.
16. G. Louchard and W. Szpankowski, "On the average redundancy rate of the Lempel-Ziv code," in Proc. 1996 IEEE Data Compression Conf. (Snowbird, UT, 1996).
17. P. Jacquet and W. Szpankowski, "Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees," Theor. Comput. Sci., vol. 144, pp. 161-197, 1995.
18. D. E. Knuth, The Art of Computer Programming: Fundamental Algorithms, vol. 1. Reading, MA: Addison-Wesley, 1973.
19. S. M. Ross, Stochastic Processes. New York: Wiley, 1983.
20. R. G. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer, 1996.
21. B. V. Gnedenko and A. N. Kolmogorov, Limit Distributions for Sums of Independent Random Variables. Cambridge, MA: Addison-Wesley, 1968.
22. A. J. Wyner, "String matching theorems and applications to data compression and statistics," Ph.D. dissertation, Stanford University, Stanford, CA, 1993.