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


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

N. Warsi

School of Technology and Computer Science

编辑信件的主要联系方式.
Email: warsi.naqueeb@gmail.com
印度, Mumbai

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2016