The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Distributed Channel Synthesis
Open accessAbstract
Two familiar notions of correlation are rediscovered as the extreme operating points for distributed synthesis of a discrete memoryless channel, in which a stochastic channel output is generated based on a compressed description of the channel input. Wyner's common information is the minimum description rate needed. However, when common randomness independent of the input is available, the necessary description rate reduces to Shannon's mutual information. This paper characterizes the optimal tradeoff between the amount of common randomness used and the required rate of description. We also include a number of related derivations, including the effect of limited local randomness, rate requirements for secrecy, applications to game theory, and new insights into common information duality. Our proof makes use of a soft covering lemma, known in the literature for its role in quantifying the resolvability of a channel. The direct proof (achievability) constructs a feasible joint distribution over all parts of the system using a soft covering, from which the behavior of the encoder and decoder is inferred, with no explicit reference to joint typicality or binning. Of auxiliary interest, this paper also generalizes and strengthens this soft covering tool.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Identifying the Information Gain of a Quantum Measurement
Berta, M., Renes, J. M., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2365207 · Cited by 60
Cited by
Covert Communication Over Noisy Channels: A Resolvability Perspective
Bloch, M. R. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2530089 · Cited by 433
Identifying the Information Gain of a Quantum Measurement
Berta, M., Renes, J. M., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2365207 · Cited by 60
Metadata
- Authors
- Cuff, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-11
- Volume
- 59
- Issue
- 11
- Pages
- 7071-7096
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1998812578
- Cited by
- 239
- References
- 2
- FWCI
- 31.28
- Type
- journal article
- Language
- en
- Open access
- green
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: Distributed Channel Synthesis. https://app.cochat.ai/papers/10.1109/tit.2013.2279330
- The paper
- Cuff, P. (2013). Distributed Channel Synthesis. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2279330
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.