The DOI matches its OpenAlex record; 6 of the 6 references it cites were found in a registry or an index.
Three-terminal communication channels
Abstract
The problem of transmitting information in a specified direction over a communication channel with three terminals is considered. Examples are given of the various ways of sending information. Basic inequalities for average mutual information rates are obtained. A coding theorem and weak converse are proved and a necessary and sufficient condition for a positive capacity is derived. Upper and lower bounds on the capacity are obtained, which coincide for channels with symmetric structure.
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
ASH, R. B. (1966) · Cited by 3,990
Channels with Side Information at the Transmitter
Shannon, C. E. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.24.0289 · Cited by 657
Coding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
Foundations of Information Theory
Feinstein, A., & Weiss, G. (1958) · Physics Today · doi:10.1063/1.3062338 · Cited by 308
Coding Theorems of Information Theory
Wolfowitz, J. (1964) · Springer eBooks · doi:10.1007/978-3-662-00237-7 · Cited by 151
Cited by
The Relay–Eavesdropper Channel: Cooperation for Secrecy
Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928272 · Cited by 774
Towards an information theory of large networks: an achievable rate region
Gupta, P., & Kumar, P. R. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814480 · Cited by 435
(2006) · Springer eBooks · doi:10.1007/1-4020-4711-8 · Cited by 363
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Cooperation in 4G - Hype or Ripe?
Dohler, M., Meddour, D.-D., Senouci, S.-M., & Saadani, A. (2008) · IEEE Technology and Society Magazine · doi:10.1109/mts.2008.918035 · Cited by 46
Metadata
- Authors
- van der Meulen, E. C.
- Venue
- Advances in Applied Probability
- Publisher
- Cambridge University Press
- Published
- 1971-01-01
- Volume
- 3
- Issue
- 01
- Pages
- 120-154
- ISSN
- 0001-8678 (ISSN-L)
- OpenAlex
- W1971536606
- Cited by
- 1,544
- References
- 6
- FWCI
- 1.01
- 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: Three-terminal communication channels. https://app.cochat.ai/papers/10.1017/s0001867800037605
- The paper
- van der Meulen, E. C. (1971). Three-terminal communication channels. Advances in Applied Probability. https://doi.org/10.1017/s0001867800037605
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.
