Second-order coding region for the discrete successive refinement source coding problem

Lin Zhou; Vincent Y.F. Tan; Mehul Motani

doi:10.1109/ISIT.2016.7541732

Second-order coding region for the discrete successive refinement source coding problem

Lin Zhou
, Vincent Y.F. Tan
, Mehul Motani

National University of Singapore

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

We derive the optimal second-order coding region for the discrete successive refinement source coding problem under the joint excess-distortion event. To do so, we define a generalization of the tilted information density and leverage its properties. In the achievability part, we make use of type covering lemmas by Kanlis and Narayan (1996) and by No, Ingber and Weissman (2015). In the converse proof, we make use of the perturbation approach by Gu and Effros (2009). We also specialize our results to successively refinable sources and provide an alternative converse proof for such sources by generalizing Kostina and Verdú's (2012) one-shot converse bound for point-to-point lossy source coding.

Original language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2414-2418
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541732
State	Published - 10 Aug 2016
Externally published	Yes
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	10/07/16 → 15/07/16

Access to Document

10.1109/ISIT.2016.7541732

Cite this

Zhou, L., Tan, V. Y. F., & Motani, M. (2016). Second-order coding region for the discrete successive refinement source coding problem. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 2414-2418). Article 7541732 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541732

@inproceedings{5f68c7c0390d4a98a6611737716ecfd7,

title = "Second-order coding region for the discrete successive refinement source coding problem",

abstract = "We derive the optimal second-order coding region for the discrete successive refinement source coding problem under the joint excess-distortion event. To do so, we define a generalization of the tilted information density and leverage its properties. In the achievability part, we make use of type covering lemmas by Kanlis and Narayan (1996) and by No, Ingber and Weissman (2015). In the converse proof, we make use of the perturbation approach by Gu and Effros (2009). We also specialize our results to successively refinable sources and provide an alternative converse proof for such sources by generalizing Kostina and Verd{\'u}'s (2012) one-shot converse bound for point-to-point lossy source coding.",

author = "Lin Zhou and Tan, \{Vincent Y.F.\} and Mehul Motani",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541732",

language = "英语",

series = "IEEE International Symposium on Information Theory - Proceedings",

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

pages = "2414--2418",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

address = "美国",

}

Zhou, L, Tan, VYF & Motani, M 2016, Second-order coding region for the discrete successive refinement source coding problem. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541732, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 2414-2418, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10/07/16. https://doi.org/10.1109/ISIT.2016.7541732

Second-order coding region for the discrete successive refinement source coding problem. / Zhou, Lin; Tan, Vincent Y.F.; Motani, Mehul.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 2414-2418 7541732 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Second-order coding region for the discrete successive refinement source coding problem

AU - Zhou, Lin

AU - Tan, Vincent Y.F.

AU - Motani, Mehul

PY - 2016/8/10

Y1 - 2016/8/10

N2 - We derive the optimal second-order coding region for the discrete successive refinement source coding problem under the joint excess-distortion event. To do so, we define a generalization of the tilted information density and leverage its properties. In the achievability part, we make use of type covering lemmas by Kanlis and Narayan (1996) and by No, Ingber and Weissman (2015). In the converse proof, we make use of the perturbation approach by Gu and Effros (2009). We also specialize our results to successively refinable sources and provide an alternative converse proof for such sources by generalizing Kostina and Verdú's (2012) one-shot converse bound for point-to-point lossy source coding.

AB - We derive the optimal second-order coding region for the discrete successive refinement source coding problem under the joint excess-distortion event. To do so, we define a generalization of the tilted information density and leverage its properties. In the achievability part, we make use of type covering lemmas by Kanlis and Narayan (1996) and by No, Ingber and Weissman (2015). In the converse proof, we make use of the perturbation approach by Gu and Effros (2009). We also specialize our results to successively refinable sources and provide an alternative converse proof for such sources by generalizing Kostina and Verdú's (2012) one-shot converse bound for point-to-point lossy source coding.

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

U2 - 10.1109/ISIT.2016.7541732

DO - 10.1109/ISIT.2016.7541732

M3 - 会议稿件

AN - SCOPUS:84985904994

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2414

EP - 2418

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Zhou L, Tan VYF, Motani M. Second-order coding region for the discrete successive refinement source coding problem. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc. 2016. p. 2414-2418. 7541732. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2016.7541732

Second-order coding region for the discrete successive refinement source coding problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this