Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
In this correspondence we investigate the performance of the Lempel-Ziv incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer which uses a Lempel-Ziv scheme to perform lossy coding.
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Oliver Bodemer
IBM J. Res. Dev
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Jose Manuel Bernabe' Murcia, Alejandro Molina Zarca, et al.
Computing