Improved Redundancy of a Version of the Lempel-Ziv Algorithm

IEEE Transactions on Information Theory

Volumn 41, Issue 3, 1995, Pages 723-731

  Wyner, Abraham J ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Data compression; Lempel Ziv coding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); ENCODING (SYMBOLS); INFORMATION THEORY; MARKOV PROCESSES; REDUNDANCY;

FINITE MEMORY SOURCES; LEMPEL-ZIV CODING;

DATA COMPRESSION;

EID: 0029307103     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.382018     Document Type: Article

References (4)

1. P. E. Bender and J. K. Wolf, “New asymptotic bounds and improvements on the Lempel—Ziv data compression algorithm,” IEEE Trans. Inform. Theory, vol. 37, pp. 721–729, 1991.
2. W. Feller, An Introduction to Probability Theory and Its Applications, 2nd ed. New York: Wiley, 1957.
3. A. D. Wyner and J. Ziv, “Some asymptotic properties of the entropy of a stationary ergodic source with applications to data compression,” IEEE Trans. Inform. Theory, vol. 35, pp. 1250–1258, Nov. 1989.
4. A. J. Wyner, “String matching theorems and applications to data compression and statistics,” Ph.D. dissertation, Stanford University, Stanford, CA, 1993. Also “The redundancy and distribution of phrase lengths of the FDLZ algorithm,” paper submitted to 1994 IEEE International Symposium on Information Theory (Trondheim, Norway).