Abstract
We propose a general model for a sequential coder, and investigate the associated coding delay. This model is employed to derive lower and upper bounds on the delay associated with the Lempel-Ziv encoder and decoder.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.E. Krichevsky and V.K. Trofimov, “The performance of Universal Encoding”, IEEE Trans. Infor. Theory, vol. IT-27, pp. 199–207, March 1981.
S. Even, “On information Lossless Automata of Finite Order”, IEEE Trans. Electronic Computers, vol. EC-14, pp. 561–569, August 1965.
A. Lempel and J. Ziv, “Compression of Individual Sequences via Variable Rate Coding”, IEEE Trans. Infor. Theory, vol. IT-24, pp. 530–536, September 1978.
A.D. Wyner, “On the Probability of Buffer Overflow under an Arbitrary Bounded Input-Output Distribution”, SIAM J. Appl. Math., vol. 27, pp. 544–570, December 1974.
N. Merhav, “Universal Coding with Minimum Probability of Codeword Length Overflow”, IEEE Trans. Infor. Theory, vol. IT-37, pp. 556–563, May 1991.
F. Jelinek, Probabilistic Information Theory, New York: McGraw-Hill, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Weinberger, M.J., Lempel, A., Ziv, J. (1992). On the Coding Delay of a General Coder. In: Storer, J.A. (eds) Image and Text Compression. The Kluwer International Series in Engineering and Computer Science, vol 176. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3596-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3596-6_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6598-3
Online ISBN: 978-1-4615-3596-6
eBook Packages: Springer Book Archive