Simple one-shot bounds for various source coding problems using smooth Rényi quantities

DOI10.1134/S0032946016010051zbMath1360.94175arXiv1511.08538OpenAlexW2963790540MaRDI QIDQ522928

Naqueeb A. Warsi

Publication date: 19 April 2017

Published in: Problems of Information Transmission (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Cites Work

• Unnamed Item
• Unnamed Item
• The quantum reverse Shannon theorem based on one-shot information theory
• On source coding with side information at the decoder
• The Operational Meaning of Min- and Max-Entropy
• Smooth Entropies and the Quantum Information Spectrum
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• The apex of the family tree of protocols: optimal rates and resource inequalities
• One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys
• Noisy Channel Coding via Privacy Amplification and Information Reconciliation
• A Father Protocol for Quantum Broadcast Channels
• Channel Coding Rate in the Finite Blocklength Regime
• One-Shot Lossy Quantum Data Compression
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Elements of Information Theory
• Noiseless coding of correlated information sources

This page was built for publication: Simple one-shot bounds for various source coding problems using smooth Rényi quantities