Kaspi problem revisited: Non-Asymptotic converse bound and second-order asymptotics

Lin Zhou; Mehul Motani

doi:10.1109/GLOCOM.2017.8254168

Kaspi problem revisited: Non-Asymptotic converse bound and second-order asymptotics

Lin Zhou
, Mehul Motani

National University of Singapore

Research output: Contribution to journal › Conference article › peer-review

4 Scopus citations

Abstract

In this paper, we revisit the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994). For the Kaspi problem, we first present the properties of optimal test channels for the rate-distortion function. Subsequently, we generalize the notion of distortion-Tilted information density for the lossy source coding problem to the Kaspi problem and prove a non-Asymptotic converse bound using the properties of optimal test channels and the well-defined distortion-Tilted information density. Finally, we derive the exact second-order coding rate of the Kaspi problem for discrete memoryless sources.

Original language	English
Pages (from-to)	1-6
Number of pages	6
Journal	Proceedings - IEEE Global Communications Conference, GLOBECOM
Volume	2018-January
DOIs	https://doi.org/10.1109/GLOCOM.2017.8254168
State	Published - 2017
Externally published	Yes
Event	2017 IEEE Global Communications Conference, GLOBECOM 2017 - Singapore, Singapore Duration: 4 Dec 2017 → 8 Dec 2017

Keywords

Distortion-Tilted information density
Kaspi problem
Non-Asymptotic converse bound
Second-order asymptotics

Access to Document

10.1109/GLOCOM.2017.8254168

Cite this

@article{0485b460c412439e8c85021ba7231f29,

title = "Kaspi problem revisited: Non-Asymptotic converse bound and second-order asymptotics",

abstract = "In this paper, we revisit the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994). For the Kaspi problem, we first present the properties of optimal test channels for the rate-distortion function. Subsequently, we generalize the notion of distortion-Tilted information density for the lossy source coding problem to the Kaspi problem and prove a non-Asymptotic converse bound using the properties of optimal test channels and the well-defined distortion-Tilted information density. Finally, we derive the exact second-order coding rate of the Kaspi problem for discrete memoryless sources.",

keywords = "Distortion-Tilted information density, Kaspi problem, Non-Asymptotic converse bound, Second-order asymptotics",

author = "Lin Zhou and Mehul Motani",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE Global Communications Conference, GLOBECOM 2017 ; Conference date: 04-12-2017 Through 08-12-2017",

year = "2017",

doi = "10.1109/GLOCOM.2017.8254168",

language = "英语",

volume = "2018-January",

pages = "1--6",

journal = "Proceedings - IEEE Global Communications Conference, GLOBECOM",

issn = "2334-0983",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Kaspi problem revisited

T2 - 2017 IEEE Global Communications Conference, GLOBECOM 2017

AU - Zhou, Lin

AU - Motani, Mehul

PY - 2017

Y1 - 2017

N2 - In this paper, we revisit the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994). For the Kaspi problem, we first present the properties of optimal test channels for the rate-distortion function. Subsequently, we generalize the notion of distortion-Tilted information density for the lossy source coding problem to the Kaspi problem and prove a non-Asymptotic converse bound using the properties of optimal test channels and the well-defined distortion-Tilted information density. Finally, we derive the exact second-order coding rate of the Kaspi problem for discrete memoryless sources.

AB - In this paper, we revisit the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994). For the Kaspi problem, we first present the properties of optimal test channels for the rate-distortion function. Subsequently, we generalize the notion of distortion-Tilted information density for the lossy source coding problem to the Kaspi problem and prove a non-Asymptotic converse bound using the properties of optimal test channels and the well-defined distortion-Tilted information density. Finally, we derive the exact second-order coding rate of the Kaspi problem for discrete memoryless sources.

KW - Distortion-Tilted information density

KW - Kaspi problem

KW - Non-Asymptotic converse bound

KW - Second-order asymptotics

UR - https://www.scopus.com/pages/publications/85046371483

U2 - 10.1109/GLOCOM.2017.8254168

DO - 10.1109/GLOCOM.2017.8254168

M3 - 会议文章

AN - SCOPUS:85046371483

SN - 2334-0983

VL - 2018-January

SP - 1

EP - 6

JO - Proceedings - IEEE Global Communications Conference, GLOBECOM

JF - Proceedings - IEEE Global Communications Conference, GLOBECOM

Y2 - 4 December 2017 through 8 December 2017

ER -

Kaspi problem revisited: Non-Asymptotic converse bound and second-order asymptotics

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this