Simple one-shot bounds for various source coding problems using smooth\n Renyi quantities

2015/11/26 by Naqueeb Ahmad Warsi, Warsi, Naqueeb Ahmad
Engineering · #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Physics (quant-ph) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1511.08538

openalex publication_date 2015/11/26 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

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

Related

• One-shot source coding with coded side information available at the decoder
• Asymptotic Expansions of Smooth Rényi Entropies and Their Applications
• Variable-Length Lossy Compression Allowing Positive Overflow and Excess\n Distortion Probabilities
• One-Shot Wyner-Ziv Compression of a Uniform Source
• On the Smooth Renyi Entropy and Variable-Length Source Coding Allowing Errors