The Gray-Wyner Network and Wyner’s Common Information for Gaussian Sources
Lists
Only you see this
Abstract
This paper presents explicit solutions for two related non-convex information extremization problems due to Gray and Wyner in the Gaussian case. The first problem is the Gray-Wyner network subject to a sum-rate constraint on the two private links. Here, our argument establishes the optimality of Gaussian codebooks and hence, a closed-form formula for the optimal rate region. The second problem is Wyner’s common information and a generalization thereof, where conditional independence is generalized to a limit on the conditional mutual information. We present full explicit solutions for the scalar as well as the vector case.
BibTeX
@article{sula2021gray,
author = {Erixhen Sula and Michael Gastpar},
title = {{The Gray-Wyner Network and Wyner’s Common Information for Gaussian Sources}},
journal = {IEEE Transactions on Information Theory},
year = {2021},
doi = {10.1109/tit.2021.3128187},
}Loading related content...