The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Multiple user information theory
Abstract
A unified framework is given for multiple user information networks. These networks consist of several users communicating to one another in the presence of arbitrary interference and noise. The presence of many senders necessitates a tradeoff in the achievable information transmission rates. The goal is the characterization of the capacity region consisting of all achievable rates. The focus is on broadcast, multiple access, relay, and other channels for which the recent theory is relativdy well developed. A discussion of the Gaussian version of these channels demonstrates the concreteness of the encoding and decoding necessary to achieve optimal information flow. We also offer speculations about the form of a general theory of information flow in networks.
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
Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty - I
Slepian, D., & Pollak, H. O. (1961) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1961.tb03976.x · Cited by 2,492
Cited by
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Medard, M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841172 · Cited by 931
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921680 · Cited by 841
On channel capacity per unit cost
Verdu, S. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57201 · Cited by 522
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
Metadata
- Authors
- El Gamal, A., & Cover, T. M.
- Venue
- Proceedings of the IEEE
- Published
- 1980
- Volume
- 68
- Issue
- 12
- Pages
- 1466-1483
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2041863035
- Cited by
- 186
- References
- 1
- FWCI
- 3.58
- 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.