The DOI matches its Crossref record.
Smooth renyi entropy and applications
Abstract
We introduce a new entropy measure, called smooth Renyi entropy. The measure characterizes fundamental properties of a random variable Z, such as the amount of uniform randomness that can be extracted from Z or the minimum length of an encoding of Z.
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
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A. (2008) · SIAM Journal on Computing · doi:10.1137/060651380 · Cited by 1,717
The Operational Meaning of Min- and Max-Entropy
Konig, R., Renner, R., & Schaffner, C. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025545 · Cited by 659
Self-citationMin- and Max-Relative Entropies and a New Entanglement Monotone
Datta, N. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018325 · Cited by 491
Cryptographic Extraction and Key Derivation: The HKDF Scheme
Krawczyk, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_34 · Cited by 408
Universally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Self-citationQuantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
Renner, R., & Wolf, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_11 · Cited by 258
Self-citationThe decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
A measure for intrinsic information
Barbosa, L. S., Marshall, W., Streipert, S., Albantakis, L., & Tononi, G. (2020) · Scientific Reports · doi:10.1038/s41598-020-75943-4 · Cited by 42
Metadata
- Authors
- Renner, R., & Wolf, S.
- Venue
- International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
- Publisher
- IEEE
- Published
- 2004-12-23
- Pages
- 232-232
- OpenAlex
- W2106654982
- Cited by
- 174
- References
- 0
- FWCI
- 1.29
- 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
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.