The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A general formula for channel capacity
Abstract
A formula for the capacity of arbitrary single-user channels without feedback (not necessarily information stable, stationary, etc.) is proved. Capacity is shown to equal the supremum, over all input processes, of the input-output inf-information rate defined as the liminf in probability of the normalized information density. The key to this result is a new converse approach based on a simple new lower bound on the error probability of m-ary hypothesis tests among equiprobable hypotheses. A necessary and sufficient condition for the validity of the strong converse is given, as well as general expressions for /spl epsiv/-capacity.>
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Entropy and Information Theory
Gray, R. M. (2011) · Springer eBooks · doi:10.1007/978-1-4419-7970-4 · Cited by 1,803
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
Asymptotic Methods in Statistical Decision Theory
Cam, L. L. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4612-4946-7 · Cited by 1,317
Entropy and Information Theory
Gray, R. M. (1990) · Springer eBooks · doi:10.1007/978-1-4757-3982-4 · Cited by 660
Coding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
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 new basic theorem of information theory
Feinstein, A. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057459 · Cited by 245
The source-channel separation theorem revisited
Vembu, S., Verdu, S., & Steinberg, Y. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.370119 · Cited by 236
Self-citationThe coding of messages subject to chance errors
Wolfowitz, J. (1957) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255380682 · Cited by 162
The weak capacity of averaged channels
Ahlswede, R. (1968) · Probability Theory and Related Fields · doi:10.1007/bf00538386 · Cited by 45
Cited by
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Self-citationOn the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
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
Bit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Metadata
- Authors
- Verdu, S., & Han, T. S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1994-07
- Volume
- 40
- Issue
- 4
- Pages
- 1147-1157
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2020347709
- Cited by
- 779
- References
- 13
- FWCI
- 7.53
- 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.