RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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

This article is cited in 1 scientific paper (total in 1 paper)

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.

Full text: PDF file (355 kB)
References: PDF file   HTML file

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

Bibliographic databases:

UDC: 621.391.1+519.72
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

Citation in format AMSBIB
\Bibitem{War16}
\by N.~A.~Warsi
\paper Simple one-shot bounds for various source coding problems using smooth R\'enyi quantities
\jour Probl. Peredachi Inf.
\yr 2016
\vol 52
\issue 1
\pages 43--71
\mathnet{http://mi.mathnet.ru/ppi2196}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3512908}
\elib{http://elibrary.ru/item.asp?id=28876228}
\transl
\jour Problems Inform. Transmission
\yr 2016
\vol 52
\issue 1
\pages 39--65
\crossref{https://doi.org/10.1134/S0032946016010051}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000376106900005}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84966356799}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2196
  • http://mi.mathnet.ru/eng/ppi/v52/i1/p43

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. Anshu, V. K. Devabathini, R. Jain, “Quantum Communication Using Coherent Rejection Sampling”, Phys. Rev. Lett., 119:12 (2017), 120506  crossref  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:152
    Full text:14
    References:18
    First page:7

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020