Abstract
In the three previous chapters it has been assumed that the probability distribution is fixed, and that both encoder and decoder share knowledge of either the actual symbol frequencies within the message, or of some underlying distribution that may be assumed to be representative of the message. While there was some discussion of alternative ways of representing the prelude in a semistatic system such as those of Algorithm 4.6 on page 83 and Algorithm 5.3 on page 102, we acted as if the only problem worth considering was that of assigning a set of codewords.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Moffat, A., Turpin, A. (2002). Adaptive Coding. In: Compression and Coding Algorithms. The Springer International Series in Engineering and Computer Science, vol 669. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0935-6_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0935-6_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5312-6
Online ISBN: 978-1-4615-0935-6
eBook Packages: Springer Book Archive