Abstract
So far, we have reviewed the field of data compression and presented a new Markov algorithm called DHPC. In this chapter we investigate adaptivity in data compression algorithms and describe how various kinds of adaptivity can be incorporated into DHPC. This yields new insights into what is desirable in an adaptive algorithm and into mechanisms for implementing adaptive algorithms in general.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Williams, R.N. (1991). A Classification of Adaptivity. In: Adaptive Data Compression. The Springer International Series in Engineering and Computer Science, vol 110. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4046-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4046-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6810-6
Online ISBN: 978-1-4615-4046-5
eBook Packages: Springer Book Archive