How to smooth entropy?

DOI10.1007/978-3-662-49192-8_32MaRDI QIDQ2794379zbMATH OpenOpenAlexFDO

Authors Maciej Skórski

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49192-8_32

zbMATH Keywords

asymptotic equipartition propertyrandomness extractorssmooth Rényi entropy

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Recommendations

• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Shannon entropy versus Renyi entropy from a cryptographic viewpoint
• Sharp lower bounds on the extractable randomness from non-uniform sources
• The effect of side-information on smooth entropy.
• scientific article; zbMATH DE number 1958554

Cited in

(4)

• Shannon entropy versus Renyi entropy from a cryptographic viewpoint
• Maximum and minimum entropy states yielding local continuity bounds
• Bounds for smooth min- and max-entropy
• Sharp lower bounds on the extractable randomness from non-uniform sources

This page was built for publication: How to smooth entropy?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794379)