An Infeasibility Result for the Multiterminal Source-Coding Problem
Aaron B. Wagner, Venkat Anantharam
Abstract
We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the "CEO problem." The bound recovers many of the converse results that have been established for special cases of the problem, including the recent one for the Gaussian version of the CEO problem.
Create a lesson
Related papers
Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files
Tati V D N Eswar, Jithin Ravi
Fundamental Limits of Covert queueing under Busy-Period Observations
Anumula Venkata Sai Sree Sahithi, Arti Yardi, Jithin Ravi
On Privacy Mechanism Design Under a Bounded α-Lift Leakage Constraint with χ2-Utility
Amirreza Zamani, Mohammad Amin Zarrabian, Parastoo Sadeghi et al.
Neural Polar Codes for Source Coding
Bashar Huleihel, Ziv Aharoni, Haim H. Permuter
Gaussian BROJA Partial Information Decomposition in Closed Form
Ohad Sheelo, Tal Golan, Ari Pakman
Goal-Oriented Ordered Autoencoding for Successive Refinement in Progressive Communication
Qi Liao, Dario Bega