RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2016 Volume 52, Issue 1, Pages 43–71 (Mi ppi2196)

This article is cited in 2 papers

Source Coding

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

N. A. Warsi

School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India

Abstract: We consider the problem of source compression under three different scenarios in the one-shot (nonasymptotic) 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 Rényi entropy and smooth max Rényi 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.

UDC: 621.391.1+519.72

Received: 11.06.2014
Revised: 22.12.2015


 English version:
Problems of Information Transmission, 2016, 52:1, 39–65

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026