|Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion
|Sourya Basu, University of Illinois at Urbana-Champaign, United States; Daewon Seo, University of Wisconsin–Madison, United States; Lav Varshney, University of Illinois at Urbana-Champaign, United States
|O.4: Multi-terminal Source Coding II
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|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.