The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A coding theorem for the discrete memoryless broadcast channel
Abstract
A coding theorem for the discrete memoryless broadcast channel is proved for the case where no common message is to he transmitted. The theorem is a generalization of the results of Cover and van der Meulen on this problem. The result is tight for broadcast channels having one deterministic component
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
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
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
Cited by
On 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
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
Weingarten, H., Steinberg, Y., & Shamai, S. S. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880064 · Cited by 1,709
A new achievable rate region for the interference channel
Han, T., & Kobayashi, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056307 · Cited by 1,588
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Sum capacity of the vector Gaussian broadcast channel and uplink–downlink duality
Viswanath, P., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814483 · Cited by 1,290
Metadata
- Authors
- Marton, K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1979-05
- Volume
- 25
- Issue
- 3
- Pages
- 306-311
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1978188352
- Cited by
- 607
- References
- 2
- FWCI
- 3.70
- 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: A coding theorem for the discrete memoryless broadcast channel. https://app.cochat.ai/papers/10.1109/tit.1979.1056046
- The paper
- Marton, K. (1979). A coding theorem for the discrete memoryless broadcast channel. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1979.1056046
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.