Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion

Sourya Basu; Daewon Seo; Lav R. Varshney

doi:10.1109/ISIT44484.2020.9174396

Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion

Sourya Basu
, Daewon Seo
, Lav R. Varshney

Department of Electrical Engineering and Computer Science

University of Illinois at Urbana-Champaign

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

5 Scopus citations

Abstract

We consider two problems in multiterminal source coding under maximal distortion: distributed coding for computing and successive refinement. In distributed coding for computing, we propose a hypergraph-based coding scheme which matches the sum-rate bound of the Berger-Tung inner bound. Further, this scheme matches the entire Berger-Tung inner region when the sources are independent and it outperforms existing graph-based coding schemes. For successive refinement, we propose a hypergraph-based scheme that attains the entire rate region.

Original language	English
Title of host publication	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2426-2431
Number of pages	6
ISBN (Electronic)	9781728164328
DOIs	https://doi.org/10.1109/ISIT44484.2020.9174396
State	Published - Jun 2020
Event	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States Duration: 21 Jul 2020 → 26 Jul 2020

Publication series

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

Conference

Conference	2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/Territory	United States
City	Los Angeles
Period	21/07/20 → 26/07/20

Bibliographical note

Publisher Copyright:
© 2020 IEEE.

Access to Document

10.1109/ISIT44484.2020.9174396

Cite this

Basu, S., Seo, D., & Varshney, L. R. (2020). Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings (pp. 2426-2431). Article 9174396 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT44484.2020.9174396

@inproceedings{2253576caed04f818ea47be738784393,

title = "Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion",

abstract = "We consider two problems in multiterminal source coding under maximal distortion: distributed coding for computing and successive refinement. In distributed coding for computing, we propose a hypergraph-based coding scheme which matches the sum-rate bound of the Berger-Tung inner bound. Further, this scheme matches the entire Berger-Tung inner region when the sources are independent and it outperforms existing graph-based coding schemes. For successive refinement, we propose a hypergraph-based scheme that attains the entire rate region.",

author = "Sourya Basu and Daewon Seo and Varshney, \{Lav R.\}",

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

year = "2020",

month = jun,

doi = "10.1109/ISIT44484.2020.9174396",

language = "English",

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

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

pages = "2426--2431",

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

}

Basu, S, Seo, D & Varshney, LR 2020, Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion. in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings., 9174396, IEEE International Symposium on Information Theory - Proceedings, vol. 2020-June, Institute of Electrical and Electronics Engineers Inc., pp. 2426-2431, 2020 IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, United States, 21/07/20. https://doi.org/10.1109/ISIT44484.2020.9174396

Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion. / Basu, Sourya; Seo, Daewon; Varshney, Lav R.
2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2020. p. 2426-2431 9174396 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June).

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

TY - GEN

T1 - Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion

AU - Basu, Sourya

AU - Seo, Daewon

AU - Varshney, Lav R.

PY - 2020/6

Y1 - 2020/6

N2 - We consider two problems in multiterminal source coding under maximal distortion: distributed coding for computing and successive refinement. In distributed coding for computing, we propose a hypergraph-based coding scheme which matches the sum-rate bound of the Berger-Tung inner bound. Further, this scheme matches the entire Berger-Tung inner region when the sources are independent and it outperforms existing graph-based coding schemes. For successive refinement, we propose a hypergraph-based scheme that attains the entire rate region.

AB - We consider two problems in multiterminal source coding under maximal distortion: distributed coding for computing and successive refinement. In distributed coding for computing, we propose a hypergraph-based coding scheme which matches the sum-rate bound of the Berger-Tung inner bound. Further, this scheme matches the entire Berger-Tung inner region when the sources are independent and it outperforms existing graph-based coding schemes. For successive refinement, we propose a hypergraph-based scheme that attains the entire rate region.

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

U2 - 10.1109/ISIT44484.2020.9174396

DO - 10.1109/ISIT44484.2020.9174396

M3 - Conference contribution

AN - SCOPUS:85090414914

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2426

EP - 2431

BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 21 July 2020 through 26 July 2020

ER -

Basu S, Seo D, Varshney LR. Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2020. p. 2426-2431. 9174396. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT44484.2020.9174396

Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this