Performance of LZ algorithms on individual sequences

IEEE Transactions on Information Theory

Volumn 45, Issue 4, 1999, Pages 1283-1288

  Shields, Paul C ^a  

^a UNIVERSITY OF TOLEDO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BLOCK CODES; CODING ERRORS; DATA COMPRESSION; PROBABILITY;

LEMPEL-ZIV CODES; SOURCE CODING;

INFORMATION THEORY;

EID: 0032673265     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.761286     Document Type: Article

References (9)

1. A. Lempel and J. Ziv On the complexity of an individual sequence," IEEE Trans. Inform. Theory, vol. IT22, pp. 75-81, 1976.
2. S. A. Savari Redundancy of the Lempel-Ziv incremental parsing rule," IEEE Trans. Inform. Theory, vol. 43, pp. 9-21, Jan. 1997.
3. _ Redundancy of the Lempel-Ziv string matching code," IEEE Trans. Inform. Theory, vol. 44, pp. 787-791, Mar. 1998.
4. P. C. Shields, The Ergodic Theory of Discrete Sample Paths (AMS Graduate Studies in Mathematics). Providence, RI: Amer. Math. Soc., 1996.
5. T. A. Welch A technique for high-performance data compression," IEEE Computer, vol. 17, no. 6, pp. 8-19, 1984.
6. A. Wyner and J. Ziv The sliding-window Lempel-Ziv algorithm is asymptotically optimal," Proc. IEEE, vol. 82, pp. 872-877, 1994.
7. J. Ziv Coding theorems for individual sequences," IEEE Trans. Inform. Theory, vol. IT24, pp. 405-412, 1978.
8. J. Ziv and A. Lempel A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT23, pp. 337-343, 1977.
9. _ Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT24, pp. 530-536, 1978.