Upper Bounds on the Probability of Sequences Emitted by Finite-State Sources and on the Redundancy of the Lempel-Ziv Algorithm

IEEE Transactions on Information Theory

Volumn 38, Issue 1, 1992, Pages 66-72

  Plotnik, Eli ^a   Weinberger, Marcelo J ^a   Ziv, Jacob ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Data compression; finite state sources; Lempel Ziv algorithm; universal coding

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; PROBABILITY;

FINITE STATE SOURCES; LEMPEL-ZIV ALGORITHM; SOURCE CODING;

CODES, SYMBOLIC;

EID: 0026712640     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.108250     Document Type: Article

References (7)

1. 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.
2. A. Lempel and J. Ziv, “On the complexity of finite sequences,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 75–81, Jan. 1976.
3. M. Wang, Private communication.
4. J. Ziv, “Compression, tests for randomness and estimating the statistical model of an individual sequence,” Sequences, R. M. Capocelli, Ed. New York: Springer-Verlag, 1990, pp. 366–373.
5. I. Amir, E. Plotnik, M. J. Weinberger, and N. Tal, “Comparison between universal data compression algorithms applied to Markov sources,” presented at Proc. Seventeenth Conv. Electr. and Electron. Engineers in Israel, May 1991.
6. J. Rissanen, “Complexity of strings in the class of Markov sources,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 526–532, July 1986.
7. R. G. Gallager, Information Theory and Reliable Communications. New York: John Wiley, 1968.