|
Problemy Peredachi Informatsii, 2016, Volume 52, Issue 1, Pages 43–71
(Mi ppi2196)
|
|
|
|
This article is cited in 2 scientific papers (total 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.
Received: 11.06.2014 Revised: 22.12.2015
Citation:
N. A. Warsi, “Simple one-shot bounds for various source coding problems using smooth Rényi quantities”, Probl. Peredachi Inf., 52:1 (2016), 43–71; Problems Inform. Transmission, 52:1 (2016), 39–65
Linking options:
https://www.mathnet.ru/eng/ppi2196 https://www.mathnet.ru/eng/ppi/v52/i1/p43
|
Statistics & downloads: |
Abstract page: | 281 | Full-text PDF : | 46 | References: | 42 | First page: | 7 |
|