Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 895

The DOI matches its Crossref record.

Rate Distortion Theory: A Mathematical Basis for Data Compression

Davisson, L.·1972·IEEE Transactions on Communications

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcom.1972.1091311

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

See all 895

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Rate Distortion Theory: A Mathematical Basis for Data Compression. https://app.cochat.ai/papers/10.1109/tcom.1972.1091311
The paper
Davisson, L. (1972). Rate Distortion Theory: A Mathematical Basis for Data Compression. IEEE Transactions on Communications. https://doi.org/10.1109/tcom.1972.1091311

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.