Abstract
We use the term data to mean digital data: data that is represented as a sequence of characters drawn from the input alphabet ∑. Data compression is the process of encoding (“compressing”) a body of data into a smaller body of data. With lossless data compression, it must be possible for the compressed data to be decoded (“decompressed”) back to the original data, whereas with lossy data compression, compressed data need only be decoded back to some acceptable approximation to the original data (where “acceptable” is defined by some fidelity criteria that is provided to the algorithm).
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
D. A. Huffman [ 1952 ]. “A Method for the Construction of Minimum-Redundancy Codes”, Proceedings of the IRE 40, 1098–1101.
A. Lempel and J. Ziv [ 1976 ]. “On the Complexity of Finite Sequences”, IEEE Transactions on Information Theory 22: 1, 75–81.
A. Lempel and J. Ziv [ 1985 ]. “Compression of Two-Dimensional Images”, Combinatorial Algorithms on Words, Springer-Verlag (A. Apostolico and Z. Galil, editors ), 141–154.
V. S. Miller and M. N. Wegman [ 1985 ]. “Variations on a Theme by Lempel and Ziv”, Combinatorial Algorithms on Words, Springer-Verlag (A. Apostolico and Z. Galil, edi-tors ), 131–140.
J. B. Seery and J. Ziv [ 1977 ]. “A Universal Data Compression Algorithm: Description and Prel-iminary Results”, Technical Memorandum 77-1212-6, Bell Laboratories, Murray Hill, N.J.
J. B. Seery and J. Ziv [ 1978 ]. “Further Results on Universal Data Compression”, Technical Memorandum 78-1212-8, Bell Laboratories, Murray Hill, N.J.
J. A. Storer [ 1988 ]. Data Compression: Methods and Theory, Computer Science Press, Rockville, MD.
T. A. Welch [ 1984 ]. “A Technique for High-Performance Data Compression”, IEEE Computer 17: 6, 8–19.
J. Ziv [ 1985 ]. “On Universal Quantization”, IEEE Transactions on Information Theory 31: 3, 344–347.
J. Ziv and A. Lempel [ 1977 ]. “A Universal Algorithm for Sequential Data Compression”, IEEE Transactions on Information Theory 23: 3, 337–343.
J. Ziv and A. Lempel [ 1978 ]. “Compression of Individual Sequences Via Variable-Rate Coding”, IEEE Transactions on Information Theory 24: 5, 530–536.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this paper
Cite this paper
Storer, J.A. (1990). Lossy On-Line Dynamic Data Compression. In: Capocelli, R.M. (eds) Sequences. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3352-7_27
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3352-7_27
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7977-8
Online ISBN: 978-1-4612-3352-7
eBook Packages: Springer Book Archive