Abstract
Let H be the entropy rate of an information source. By the source coding theorem, it is possible to design a source code with rate R which reconstructs the source sequence X = (X1, X2, …, X n ) with an arbitrarily small probability of error provided R > H and the block length n is sufficiently large. However, there are situations in which we want to convey an information source by a source code with rate less than H. Then we are motivated to ask: what is the best we can do when R < H?
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
Yeung, R.W. (2002). Rate-Distortion Theory. In: A First Course in Information Theory. Information Technology: Transmission, Processing and Storage. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8608-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8608-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4645-6
Online ISBN: 978-1-4419-8608-5
eBook Packages: Springer Book Archive