Technical Program

Paper Detail

Paper IDO.4.2
Paper Title Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer Bound
Authors Omer Bilgen, Aaron B. Wagner, Cornell University, 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 provide a method for outer bounding the rate-distortion region of Gaussian distributed compression problems in which the source variables can be embedded in a Gauss-Markov tree. The outer bound so obtained takes the form of a convex optimization problem. Simulations demonstrate that the outer bound is close to the Berger-Tung inner bound, coinciding with it in many cases.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!