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 | |
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.