Coding Theorems for Compound Problems via Quantum Rényi Divergences
From MaRDI portal
Publication:2977402
DOI10.1109/TIT.2015.2417877zbMath1359.94344arXiv1310.7525OpenAlexW3101431262MaRDI QIDQ2977402
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.7525
Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items (8)
Strong converse exponent for classical-quantum channel coding ⋮ Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels ⋮ Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks ⋮ Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks ⋮ Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages ⋮ Applications of position-based coding to classical communication over quantum channels ⋮ Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender ⋮ Properties of noncommutative Rényi and Augustin information
This page was built for publication: Coding Theorems for Compound Problems via Quantum Rényi Divergences
