English
Related papers

Related papers: Shannon Bounds on Lossy Gray-Wyner Networks

200 papers

The Shannon lower bound has been the subject of several important contributions by Berger. This paper surveys Shannon bounds on rate-distortion problems under mean-squared error distortion with a particular emphasis on Berger's techniques.…

Information Theory · Computer Science 2024-09-24 Michael Gastpar , Erixhen Sula

We consider the problem of source coding subject to a fidelity criterion for the Gray-Wyner network that connects a single source with two receivers via a common channel and two private channels. The pareto-optimal trade-offs between the…

Information Theory · Computer Science 2020-10-01 Erixhen Sula , Michael Gastpar

We revisit the Gray-Wyner lossy source coding problem and derive the first-order asymptotic optimal rate-distortion-perception region when additional perception constraints are imposed on reproduced source sequences. The optimal trade-off…

Information Theory · Computer Science 2026-01-19 Yu Yang , Yingxin Zhang , Weijie Yuan , Lin Zhou

In this paper, the rate-distortion theory of the Gray-Wyner lossy source coding system is investigated. For the case of jointly Gaussian distributed sources, we establish an expression for the rate-distortion function under the constraint…

Information Theory · Computer Science 2023-03-29 Guojun Chen , Yinfei Xu , Ling Liu , Tiecheng Song , Jing Hu

An important notion of common information between two random variables is due to Wyner. In this paper, we derive a lower bound on Wyner's common information for continuous random variables. The new bound improves on the only other general…

Information Theory · Computer Science 2021-02-17 Erixhen Sula , Michael Gastpar

We show the mutual information between the targets in a Gray-Wyner Network as a bound that separates Wyner's lossy common information and G\'acs-K\"orner lossy common information. The results are a generalization of the lossless case…

Information Theory · Computer Science 2025-12-04 Anderson de Andrade

Given finite-dimensional random vectors $Y$, $X$, and $Z$ that form a Markov chain in that order (i.e., $Y \to X \to Z$), we derive upper bounds on the excess minimum risk using generalized information divergence measures. Here, $Y$ is a…

Information Theory · Computer Science 2025-06-02 Ananya Omanwar , Fady Alajaji , Tamás Linder

The two most prevalent notions of common information (CI) are due to Wyner and Gacs-Korner and both the notions can be stated as two different characteristic points in the lossless Gray-Wyner region. Although the information theoretic…

Information Theory · Computer Science 2014-04-01 Kumar Viswanatha , Emrah Akyol , Kenneth Rose

This paper investigates the joint source-channel coding problem of sending a memoryless source over a memoryless broadcast channel. An inner bound and several outer bounds on the admissible distortion region are derived, which respectively…

Information Theory · Computer Science 2018-06-11 Lei Yu , Houqiang Li , Weiping Li

The Shannon lower bound is one of the few lower bounds on the rate-distortion function that holds for a large class of sources. In this paper, it is demonstrated that its gap to the rate-distortion function vanishes as the allowed…

Information Theory · Computer Science 2016-11-17 Tobias Koch

In this paper, tight upper and lower bounds are derived on the weighted sum of minimum mean-squared errors for additive Gaussian noise channels. The bounds are obtained by constraining the input distribution to be close to a Gaussian…

Information Theory · Computer Science 2020-01-23 Michael Fauß , Abdelhak M. Zoubir , Alex Dytso , H. Vincent Poor , K. G. Nagananda

Wyner's common information was originally defined for a pair of dependent discrete random variables. Its significance is largely reflected in, hence also confined to, several existing interpretations in various source coding problems. This…

Information Theory · Computer Science 2013-01-11 Ge Xu , Wei Liu , Biao Chen

We consider a source coding problem with a network scenario in mind, and formulate it as a remote vector Gaussian Wyner-Ziv problem under covariance matrix distortions. We define a notion of minimum for two positive-definite matrices based…

Information Theory · Computer Science 2016-11-03 Adel Zahedi , Jan Østergaard , Søren Holdt Jensen , Patrick A. Naylor , Søren Bech

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's chain rule for entropy as well as…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Prasad Tetali

The Gray and Wyner lossy source coding for a simple network for sources that generate a tuple of jointly Gaussian random variables (RVs) $X_1 : \Omega \rightarrow {\mathbb R}^{p_1}$ and $X_2 : \Omega \rightarrow {\mathbb R}^{p_2}$, with…

Information Theory · Computer Science 2020-01-22 Charalambos D. Charalambous , Jan H. van Schuppen

In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within…

Information Theory · Computer Science 2008-08-21 Dinesh Krithivasan , S. Sandeep Pradhan

For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of…

Information Theory · Computer Science 2020-08-26 Guangyue Han , Shlomo Shamai

In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…

We establish the rate region of an extended Gray-Wyner system for 2-DMS $(X,Y)$ with two additional decoders having complementary causal side information. This extension is interesting because in addition to the operationally significant…

Information Theory · Computer Science 2018-12-11 Cheuk Ting Li , Abbas El Gamal

We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios. We explicitly characterize the tradeoff between the rates of…

Information Theory · Computer Science 2015-06-16 Sanket Satpathy , Paul Cuff
‹ Prev 1 2 3 10 Next ›