One-shot source coding with coded side information available at the decoder

2013/03/11 by Warsi, Naqueeb Ahmad
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1303.2579

Abstract

One-shot achievable rate region for source coding when coded side information is available at the decoder (source coding with a helper) is proposed. The achievable region proposed is in terms of conditional smooth max Renyi entropy and smooth max Renyi divergence. Asymptotically (in the limit of large block lengths) this region is quantified in terms of spectral-sup conditional entropy rate and spectral- sup mutual information rate. In particular, it coincides with the rate region derived in the limit of unlimited independent and identically distributed copies of the sources.

Related

• Simple one-shot bounds for various source coding problems using smooth\n Renyi quantities
• Asymptotic Expansions of Smooth Rényi Entropies and Their Applications
• Distributed Source Coding, Multiple Description Coding, and Source Coding with Side Information at Decoders Using Constrained-Random Number Generators
• Non-asymptotic information theoretic bound for some multi-party\n scenarios
• Variable-Length Lossy Compression Allowing Positive Overflow and Excess\n Distortion Probabilities