A property of the intrinsic mutual information
The DOI matches its Crossref record.
Abstract
The so-called intrinsic mutual infor- mation is an important measure in the context of information-theoretic secret-key agreement. We prove a property of this information measure which, in particular, strongly simplifies its computation. More generally, our result is useful for analyzing the correlation of two random variables conditioned on a third one.
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
Cited by
“Squashed entanglement”: An additive entanglement measure
Christandl, M., & Winter, A. (2004) · Journal of Mathematical Physics · doi:10.1063/1.1643788 · Cited by 451
Self-citationInformation-Theoretically Secret Key Generation for Fading Wireless Channels
Ye, C., Mathur, S., Reznik, A., Shah, Y., Trappe, W., & Mandayam, N. B. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2043187 · Cited by 417
The Squashed Entanglement of a Quantum Channel
Takeoka, M., Guha, S., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2330313 · Cited by 107
“Due to a lack of an upper bound on the dimension of the output E ′ of the squashing channel, it is not yet known whether the infimization in (3) can be replaced by a minimization, but note that such a replacement is possible for the classical intrinsic information [12].”
BackgroundShared information—new insights and problems in decomposing information in complex systems
Bertschinger, N., Rauh, J., Olbrich, E., & Jost, J. (2013) · Springer Proceedings in Complexity · doi:10.1007/978-3-319-00395-5_35 · Cited by 45
“Security of quantum key distribution protocols,”
Mafu, M., & Senekane, M. (2018) · Advanced Technologies of Quantum Key Distribution · doi:10.5772/intechopen.74234 · Cited by 20
Metadata
- Authors
- Christandl, M., Renner, R., & Wolf, S.
- Venue
- IEEE International Symposium on Information Theory, 2003. Proceedings.
- Publisher
- IEEE
- Published
- 2003
- Pages
- 258-258
- OpenAlex
- W2133129288
- Cited by
- 32
- References
- 0
- FWCI
- 1.73
- Type
- conference paper
- 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 property of the intrinsic mutual information. https://app.cochat.ai/papers/10.1109/isit.2003.1228272
- The paper
- Christandl, M., Renner, R., & Wolf, S. (2003). A property of the intrinsic mutual information. IEEE International Symposium on Information Theory, 2003. Proceedings. https://doi.org/10.1109/isit.2003.1228272
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.