Ozarow- Type Outer Bounds for Memoryless Sources and Channels

Yuval Kochman; Or Ordentlich; Yury Polyanskiy

doi:10.1109/ISIT.2018.8437864

Ozarow- Type Outer Bounds for Memoryless Sources and Channels

Yuval Kochman, Or Ordentlich, Yury Polyanskiy

The Rachel and Selim Benin School of Engineering and Computer Science

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

7 Scopus citations

Abstract

Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarow's technique for establishing impossibility results, and extend it to general sources and distortion measures. For the problem of sending a source over a broadcast channel, we revisit the bounding technique of Reznik, Feder and Zamir, and extend it to general sources, distortion measures and broadcast channels. Although the obtained bounds do not improve over existing results in the literature, they are relatively easy to evaluate, and their derivation reveals the similarities between the two bounding techniques.

Original language	English
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1774-1778
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437864
State	Published - 15 Aug 2018
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: 17 Jun 2018 → 22 Jun 2018

Publication series

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

Conference

Conference	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	17/06/18 → 22/06/18

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Access to Document

10.1109/ISIT.2018.8437864

Cite this

Kochman, Y., Ordentlich, O., & Polyanskiy, Y. (2018). Ozarow- Type Outer Bounds for Memoryless Sources and Channels. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 1774-1778). Article 8437864 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437864

@inproceedings{ea3f5d69ba5c41599253ab4f443e2a28,

title = "Ozarow- Type Outer Bounds for Memoryless Sources and Channels",

abstract = "Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarow's technique for establishing impossibility results, and extend it to general sources and distortion measures. For the problem of sending a source over a broadcast channel, we revisit the bounding technique of Reznik, Feder and Zamir, and extend it to general sources, distortion measures and broadcast channels. Although the obtained bounds do not improve over existing results in the literature, they are relatively easy to evaluate, and their derivation reveals the similarities between the two bounding techniques.",

author = "Yuval Kochman and Or Ordentlich and Yury Polyanskiy",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437864",

language = "אנגלית",

isbn = "9781538647806",

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

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

pages = "1774--1778",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

address = "ארצות הברית",

}

Kochman, Y , Ordentlich, O & Polyanskiy, Y 2018, Ozarow- Type Outer Bounds for Memoryless Sources and Channels. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437864, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 1774-1778, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17/06/18. https://doi.org/10.1109/ISIT.2018.8437864

Ozarow- Type Outer Bounds for Memoryless Sources and Channels. / Kochman, Yuval ; Ordentlich, Or; Polyanskiy, Yury.
2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1774-1778 8437864 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

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

TY - GEN

T1 - Ozarow- Type Outer Bounds for Memoryless Sources and Channels

AU - Kochman, Yuval

AU - Ordentlich, Or

AU - Polyanskiy, Yury

PY - 2018/8/15

Y1 - 2018/8/15

N2 - Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarow's technique for establishing impossibility results, and extend it to general sources and distortion measures. For the problem of sending a source over a broadcast channel, we revisit the bounding technique of Reznik, Feder and Zamir, and extend it to general sources, distortion measures and broadcast channels. Although the obtained bounds do not improve over existing results in the literature, they are relatively easy to evaluate, and their derivation reveals the similarities between the two bounding techniques.

AB - Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarow's technique for establishing impossibility results, and extend it to general sources and distortion measures. For the problem of sending a source over a broadcast channel, we revisit the bounding technique of Reznik, Feder and Zamir, and extend it to general sources, distortion measures and broadcast channels. Although the obtained bounds do not improve over existing results in the literature, they are relatively easy to evaluate, and their derivation reveals the similarities between the two bounding techniques.

UR - http://www.scopus.com/inward/record.url?scp=85052465173&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2018.8437864

DO - 10.1109/ISIT.2018.8437864

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85052465173

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1774

EP - 1778

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 17 June 2018 through 22 June 2018

ER -

Ozarow- Type Outer Bounds for Memoryless Sources and Channels

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this