The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
The convolution inequality for entropy powers
Abstract
The entropy power of a band-limited random process is the power of white Gaussian noise having the same entropy rate. Shannon's convolution inequality for entropy power states that the entropy power of the sum of two independent random processes is at least the sum of their entropy powers. This paper presents an improved version of Stam's proof of this inequality, which is obtained by mathematical induction from the one-dimensional case.
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.
Integrity signals
Registry
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.
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
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Some inequalities satisfied by the quantities of information of Fisher and Shannon
Stam, A. J. (1959) · Information and Control · doi:10.1016/s0019-9958(59)90348-1 · Cited by 706
Regent Results in Comma-Free Codes
Jiggs, B. H. (1963) · Canadian Journal of Mathematics · doi:10.4153/cjm-1963-021-1 · Cited by 50
Cited by
Leung-Yan-Cheong, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055917 · Cited by 2,004
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
Weingarten, H., Steinberg, Y., & Shamai, S. S. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880064 · Cited by 1,709
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
The Brunn-Minkowski inequality
Gardner, R. J. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00941-2 · Cited by 894
Information theoretic inequalities
Dembo, A., Cover, T. M., & Thomas, J. A. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.104312 · Cited by 742
Metadata
- Authors
- Blachman, N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1965-04
- Volume
- 11
- Issue
- 2
- Pages
- 267-271
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2171750587
- Cited by
- 331
- References
- 4
- FWCI
- 0.00
- 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: The convolution inequality for entropy powers. https://app.cochat.ai/papers/10.1109/tit.1965.1053768
- The paper
- Blachman, N. (1965). The convolution inequality for entropy powers. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1965.1053768
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.