Abstract
The coding algorithms presented so far have focussed on minimizing the expected length of a code, and on fast coding speed once a code has been devised. Furthermore, all codes have used a binary channel alphabet. This chapter examines other coding problems.
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). Additional Constraints. 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_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0935-6_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5312-6
Online ISBN: 978-1-4615-0935-6
eBook Packages: Springer Book Archive