The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
On channel capacity per unit cost
Abstract
Memoryless communication channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The maximum number of bits that can be transmitted reliably through the channel per unit cost is studied. It is shown that, if the input alphabet contains a zero-cost symbol, then the capacity per unit cost admits a simple expression as the maximum normalized divergence between two conditional output distributions. The direct part of this coding theorem admits a constructive proof via Stein's lemma on the asymptotic error probability of binary hypothesis tests. Single-user, multiple-access, and interference channels are studied.>
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
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
ASH, R. B. (1966) · Cited by 3,990
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Brémaud, P. (1981) · Springer Series in Statistics · doi:10.1007/978-1-4684-9477-8 · Cited by 1,652
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Point Processes and Queues: Martingale Dynamics.
Vere-Jones, D., & Bremaud, P. (1983) · Journal of the American Statistical Association · doi:10.2307/2288173 · Cited by 1,065
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
An Introduction to Information Theory.
Mallows, C. L., & Reza, F. M. (1964) · The American Mathematical Monthly · doi:10.2307/2311344 · Cited by 771
Information and information stability of random variables and processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90319-9 · Cited by 758
Information Theory and Statistics
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch11 · Cited by 729
Information and Information Stability of Random Variables and Processes.
Brillinger, D. R., Pinsker, M. S., & Feinstein, A. (1964) · Applied Statistics · doi:10.2307/2985711 · Cited by 378
A lower bound for discrimination information in terms of variation (Corresp.)
Kullback, S. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053968 · Cited by 359
Multiple user information theory
El Gamal, A., & Cover, T. M. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11897 · Cited by 186
Cited by
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
Fading channels: information-theoretic and communications aspects
Biglieri, E., Proakis, J., & Shamai, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720551 · Cited by 1,931
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Spectral efficiency in the wideband regime
Verdu, S. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003824 · Cited by 1,214
Self-citationMutual Information and Minimum Mean-Square Error in Gaussian Channels
Guo, D., Shamai, S., & Verdu, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844072 · Cited by 1,201
Self-citation
Metadata
- Authors
- Verdu, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1990
- Volume
- 36
- Issue
- 5
- Pages
- 1019-1030
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2130128605
- Cited by
- 522
- References
- 17
- FWCI
- 2.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
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.