References

1

J. Ziv and A. Lempel:``A Universal Algorithm for Sequential Date-Compression'' Lempel), IEEE Trans. on Inf. Theory, Vol. IT-23, No. 3, May 1977, pp. 337-343.

2

A.D. Wyner and J. Ziv, "The Sliding-Window Lempel-Ziv Algorithm is Asymptotically y Optimal'', (Invited paper), Proceedings of the IEEE, 82, June 1994, pp. 872-877.

3

E.Plotnik, M.Weinberger and J.Ziv ``Upper Bounds on the Probability of a Sequence Emitted from a Finite-State Source and on the Redundancy of the Lempel-Ziv Data Compression Algorithm'', IEEE Trans. on Information Theory, pp. 66-72, January 1992.

4

A.D.Wyner and J.Ziv ``Classification with Finite Memory'', IEEE Trans. on Information Theory Vol. 42, No. 2, March 1996, pp. 337-347.

5

Y. Hershkovits and J.Ziv ``On Sliding-Window Universal Data Compression with Limited-Memory'' submitted to the IEEE Trans. on Information Theory.

6

N.Merhav and J.Ziv ``On the Amount of Side Information Required for Lossy Data Compression'' IEEE Trans. on Information Theory, Vol 43, July 1997, pp 1112-1121.

7

M.Zakai and J.Ziv ``On Functionals Satisfying a Data-Processing Theory'' IEEE Trans. on Inf. Theory, Vol. IT-19, No. 3, May 1973, pp. 275-283.