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

DOI10.1134/S0032946016010051zbMATH Open1360.94175arXiv1511.08538OpenAlexW2963790540MaRDI QIDQ522928FDOQ522928

Authors: Naqueeb A. Warsi 

Publication date: 19 April 2017

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

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

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

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

Mathematics Subject Classification ID

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

Cites Work

• Elements of Information Theory
• Title not available (Why is that?)
• One-Shot Lossy Quantum Data Compression
• The Operational Meaning of Min- and Max-Entropy
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• On source coding with side information at the decoder
• Channel Coding Rate in the Finite Blocklength Regime
• The quantum reverse Shannon theorem based on one-shot information theory
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Noiseless coding of correlated information sources
• Title not available (Why is that?)
• A Father Protocol for Quantum Broadcast Channels
• Smooth Entropies and the Quantum Information Spectrum
• 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

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)