The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Broadcast channels
Abstract
We introduce the problem of a single source attempting to communicate information simultaneously to several receivers. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listeners. Thus several different channels with a common input alphabet are specified. We shall determine the families of simultaneously achievable transmission rates for many extreme classes of channels. Upper and lower bounds on the capacity region will be found, and it will be shown that the family of theoretically achievable rates dominates the family of rates achievable by previously known time-sharing and maximin procedures. This improvement is gained by superimposing high-rate information on low-rate information. All of these results lead to a new approach to the compound channels problem.
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
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
The Capacity of a Class of Channels
Blackwell, D., Breiman, L., & Thomasian, A. J. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706106 · Cited by 330
Coding Theorems of Information Theory
Wolfowitz, J. (1964) · Springer eBooks · doi:10.1007/978-3-662-00237-7 · Cited by 151
Cited by
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332
A Tractable Approach to Coverage and Rate in Cellular Networks
Andrews, J. G., Baccelli, F., & Ganti, R. K. (2011) · IEEE Transactions on Communications · doi:10.1109/tcomm.2011.100411.100541 · Cited by 3,170
Power-Domain Non-Orthogonal Multiple Access (NOMA) in 5G Systems: Potentials and Challenges
Islam, S. M. R., Avazov, N., Dobre, O. A., & Kwak, K.-S. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2621116 · Cited by 2,458
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective
Goldsmith, A., Jafar, S. A., Maric, I., & Srinivasa, S. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015717 · Cited by 2,398
An algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
Metadata
- Authors
- Cover, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1972-01
- Volume
- 18
- Issue
- 1
- Pages
- 2-14
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2296441616
- Cited by
- 1,670
- References
- 3
- FWCI
- 18.15
- 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.