The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal

Proceedings of the IEEE

Volumn 82, Issue 6, 1994, Pages 872-877

  Wyner, Aaron D ^a   Ziv, Jacob ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; OPTIMAL SYSTEMS; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

SLIDING WINDOW LEMPEL-ZIV ALGORITHM; SOFTWARE PACKAGE STACKER;

DATA COMPRESSION;

EID: 0028448560     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.286191     Document Type: Article

References (6)

1. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
2. R. Gallager, Information Theory of Reliable Communication. New York: Wiley, 1968.
3. D. Whiting, G. George, and G. Ivey, “Data compression apparatus and method,” US Patent 5016009, 1991 (assigned to Stac, Inc.).
4. A. D. Wyner and J. Ziv, “Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression,” IEEE Trans. Informat. Theory, vol. 36, pp. 1250–1258, Nov. 1989.
5. “Fixed data base version of the Lempel-Ziv data compression algorithm,” IEEE Trans. Informat. Theory, vol. 37, pp. 878–880, May 1991.
6. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Trans. Informat. Theory, vol. IT-24, pp. 337–343, May 1977.