The DOI matches its Crossref record.
Rate Distortion Theory: A Mathematical Basis for Data Compression
Abstract
Shannon's Information Theory created a great intellectual impact at the time of its publication. Aside from its intrinsic beauty, it presented the truly powerful concept of a definite channel capacity. This capacity, as must have been very surprising at the time, is measured in bits/second, rather than in units of bandwidth. "Rate Distortion Theory" played a very important role in the "Information Theory" formulated by Shannon: it provided a link between the traditional theory of modulation, and the material of discrete sources and channels. This topic, however, received almost no attention until the latter sixties. 1 An increasing amount of effort is now being devoted to this area, and Dr. Berger's book is therefore a very timely contribution. The fact that Rate Distortion Theory had been ignored for so long can only be explained by the strength of the impact carried in the other topics introduced by Shannon. The progression of information theoretic research has duplicated, in a surprisingly close way, the organization of Shannon's original papers. The initial effort was devoted to constructing source codes for discrete alphabets. A second wave covered codes and performance bounds for assorted analog and discrete channels. It is somewhat ironic that interest in such a "traditional" topic as the encoding of continuous sources revived at a time when many sources are, at last, truly digital. Dr. Berger's book is quite direct. After a short introductory chapter, it devotes three chapters to presenting what may be called the fundamentals of Rate Distortion Theory. The rate distortion function of a finite alphabet memoryless source is defined in Chapter 2, and the problem of calculating this function is carefully discussed. The significance of this function in coding and transmission is demonstrated in Chapter 3. Chapter 4 repeats the material of Chapter 2 for continuous-amplitude sources, as well as presentirig the important results on vector-valued and stationary Gaussian
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The rate-distortion function for source coding with side information at the decoder
Wyner, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055508 · Cited by 3,023
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
Feedback Control Under Data Rate Constraints: An Overview
Nair, G. N., Fagnani, F., Zampieri, S., & Evans, R. J. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887294 · Cited by 1,090
Performance models of statistical multiplexing in packet video communications
Maglaris, B., Anastassiou, D., Sen, P., Karlsson, G., & Robbins, J. D. (1988) · IEEE Transactions on Communications · doi:10.1109/26.2812 · Cited by 982
Toeplitz and Circulant Matrices: A Review
Gray, R. M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019680 · Cited by 759
Berger, T. (2003) · Wiley Encyclopedia of Telecommunications · doi:10.1002/0471219282.eot142 · Cited by 717
To code, or not to code: lossy source-channel communication revisited
Gastpar, M., Rimoldi, B., & Vetterli, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810631 · Cited by 550
On the capacity of wireless networks: the relay case
Gastpar, M., & Vetterli, M. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019409 · Cited by 467
Adapting multimedia Internet content for universal access
Mohan, R., Smith, J. R., & Li, C.-S. (1999) · IEEE Transactions on Multimedia · doi:10.1109/6046.748175 · Cited by 463
Data compression and harmonic analysis
Donoho, D. L., Vetterli, M., DeVore, R. A., & Daubechies, I. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720544 · Cited by 432
Distortion measures for speech processing
Gray, R., Buzo, A., Gray, A., & Matsuyama, Y. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163421 · Cited by 388
Statistical-model-based speech enhancement systems
Ephraim, Y. (1992) · Proceedings of the IEEE · doi:10.1109/5.168664 · Cited by 378
Lattices Which Are Good for (Almost) Everything
Erez, U., Litsyn, S., & Zamir, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855591 · Cited by 365
Davisson, L. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055092 · Cited by 365
Self-citationOptimal quantizer design for noisy channels: An approach to combined source - channel coding
Farvardin, N., & Vaishampayan, V. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057373 · Cited by 332
Orlitsky, A., & Roche, J. R. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915643 · Cited by 307
Jayasankar, U., Thirumal, V., & Ponnurangam, D. (2021) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2018.05.006 · Cited by 279
The evolution of color naming reflects pressure for efficiency: Evidence from the recent past
Zaslavsky, N., Garvin, K., Kemp, C., Tishby, N., & Regier, T. (2022) · Journal of Language Evolution · doi:10.1093/jole/lzac001 · Cited by 23
Metadata
- Authors
- Davisson, L.
- Venue
- IEEE Transactions on Communications
- Published
- 1972-12
- Volume
- 20
- Issue
- 6
- Pages
- 1202-1202
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W1990992471
- Cited by
- 895
- References
- 0
- FWCI
- 23.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.