Fixed Data Base Version of The Lempel-Ziv Data Compression Algorithm

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 878-880

  Wyner, A D ^a   Ziv, J ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

data compression; fixed database; Lempel Ziv

Indexed keywords

DATABASE SYSTEMS; PROBABILITY; SIGNAL PROCESSING - SIGNAL ENCODING;

ENTROPY RATE; FINITE-ORDER MARKOV SOURCE; FIXED DATABASE; LEMPEL-ZIV DATA COMPRESSION ALGORITHM;

INFORMATION THEORY;

EID: 0026157964     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79955     Document Type: Article

References (3)

1. J. Ziv and A. Lempel, “Comparison of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 530–536, Sept. 1978.
2. M. Rodeh, V. R. Pratt, and S. Even, “Linear algorithm for data compression via string matching,” J. Assoc. Comput. Mach., vol. 28, sect. 3, pp. 16–24, Jan. 1981.
3. 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. Inform. Theory, vol. 35, no. 6, pp. 1250–1258, Nov. 1989.