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

DOI10.1134/S0032946016010051MaRDI QIDQ522928zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: We consider the problem of source compression under three different scenarios in the one-shot (non- asymptotic) regime. To be specific, we prove one-shot achievability and converse bounds on the coding rates for distributed source coding, source coding with coded side information available at the decoder and source coding under maximum distortion criterion. The one-shot bounds obtained are in terms of smooth max Renyi entropy and smooth max Renyi divergence. Our results are powerful enough to yield the results that are known for these problems in the asymptotic regime both in the i.i.d. (independent and identically distributed) and non-i.i.d. settings

Recommendations

• On Smooth Rényi Entropies: A Novel Information Measure, One-Shot Coding Theorems, and Asymptotic Expansions
• Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures
• On the Conditional Smooth Rényi Entropy and its Applications in Guessing and Source Coding
• Source coding with escort distributions and Rényi entropy bounds
• Refinement of the Random Coding Bound
• A Unified Random Coding Bound
• New Bounds on the Expected Length of Optimal One-to-One Codes
• An achievable bound for optimal noiseless coding of a random variable (Corresp.)
• Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
• Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding

Cites work

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

Cited in

(1)

• On Smooth Rényi Entropies: A Novel Information Measure, One-Shot Coding Theorems, and Asymptotic Expansions

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

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