Chain Rules for Smooth Min- and Max-Entropies

DOI10.1109/TIT.2013.2238656zbMath1364.94256arXiv1205.5231OpenAlexW2136698279WikidataQ60026411 ScholiaQ60026411MaRDI QIDQ2989237

Frédéric Dupuis, Renato Renner, Alexander Vitanov, Marco Tomamichel

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.5231

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items (11)

The information theoretic interpretation of the length of a curve ⋮ Quantum skew divergence ⋮ Bounds for smooth min- and max-entropy ⋮ Optimizing the decoy-state BB84 QKD protocol parameters ⋮ Entropy accumulation ⋮ Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels ⋮ Chain rules for quantum Rényi entropies ⋮ Entanglement-assisted private communication over quantum broadcast channels ⋮ Smooth min-entropy lower bounds for approximation chains ⋮ One-shot holography ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

This page was built for publication: Chain Rules for Smooth Min- and Max-Entropies