Technical Program

Paper Detail

Paper IDO.4.1
Paper Title Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion
Authors 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
Session O.4: Multi-terminal Source Coding II
Presentation Lecture
Track Source Coding
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!