English
Related papers

Related papers: An Outer Bound for the Vector Gaussian CEO Problem

200 papers

In this paper, we study the vector Gaussian Chief Executive Officer (CEO) problem under logarithmic loss distortion measure. Specifically, $K \geq 2$ agents observe independently corrupted Gaussian noisy versions of a remote vector Gaussian…

Information Theory · Computer Science 2019-02-27 Yigit Ugur , Inaki Estella Aguerri , Abdellatif Zaidi

We study the vector Gaussian Chief Executive Officer (CEO) problem under logarithmic loss distortion measure. Specifically, $K \geq 2$ agents observe independently corrupted Gaussian noisy versions of a remote vector Gaussian source, and…

Information Theory · Computer Science 2020-02-05 Yigit Ugur , Inaki Estella Aguerri , Abdellatif Zaidi

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…

Information Theory · Computer Science 2007-07-16 Aaron B. Wagner , Venkat Anantharam

We investigate the rate-distortion-leakage region of the Chief Executive Officer (CEO) problem, considering the presence of a passive eavesdropper and privacy constraints. We start by examining the region where a general distortion measure…

Information Theory · Computer Science 2025-01-22 Vamoua Yachongka , Hideki Yagi , Hideki Ochiai

We study a lossy source coding problem with secrecy constraints in which a remote information source should be transmitted to a single destination via multiple agents in the presence of a passive eavesdropper. The agents observe noisy…

Information Theory · Computer Science 2015-02-19 Farshad Naghibi , Somayeh Salimi , Mikael Skoglund

The distributed remote source coding (so-called CEO) problem is studied in the case where the underlying source, not necessarily Gaussian, has finite differential entropy and the observation noise is Gaussian. The main result is a new lower…

Information Theory · Computer Science 2019-02-08 Krishnan Eswaran , Michael Gastpar

This paper studies a class of source coding problems that combines elements of the CEO problem with the multiple description problem. In this setting, noisy versions of one remote source are observed by two nodes with encoders (which is…

Information Theory · Computer Science 2010-01-07 Rajiv Soundararajan , Aaron B. Wagner , Sriram Vishwanath

We determine the rate region of the Gaussian scalar-help-vector source-coding problem under a covariance matrix distortion constraint. The rate region is achieved by a Gaussian achievable scheme. We introduce a novel outer bounding…

Information Theory · Computer Science 2010-01-27 Md Saifur Rahman , Aaron B. Wagner

We establish a new extremal inequality, which is further leveraged to give a complete characterization of the rate region of the vector Gaussian CEO problem with the trace distortion constraint. The proof of this extremal inequality hinges…

Information Theory · Computer Science 2014-02-21 Yinfei Xu , Qiao Wang

We consider the CEO problem for non-regular source distributions (such as uniform or truncated Gaussian). A group of agents observe independently corrupted versions of data and transmit coded versions over rate-limited links to a CEO. The…

Information Theory · Computer Science 2015-03-24 Aditya Vempaty , Lav R. Varshney

In this work, the rate region of the vector Gaussian multiple description problem with individual and central quadratic distortion constraints is studied. In particular, an outer bound to the rate region of the L-description problem is…

Information Theory · Computer Science 2016-11-18 Guoqiang Zhang , W. Bastiaan Kleijn , Jan Østergaard

An $n$-dimensional source with memory is observed by $K$ isolated encoders via parallel channels, who compress their observations to transmit to the decoder via noiseless rate-constrained links while leveraging their memory of the past. At…

Information Theory · Computer Science 2021-11-25 Victoria Kostina , Babak Hassibi

We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of…

Information Theory · Computer Science 2010-11-22 Chao Tian , Suhas Diggavi , Shlomo Shamai

In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a…

Information Theory · Computer Science 2014-06-05 Adel Zahedi , Jan Ostergaard , Soren Holdt Jensen , Patrick Naylor , Soren Bech

The multi-terminal rate-distortion problem has been studied extensively. Notably, among these, Tung and Housewright have provided the best known inner and outer bounds for the rate region under certain distortion constraints. In this paper,…

Information Theory · Computer Science 2007-07-16 W. Kang , S. Ulukus

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

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

In the distributed remote (CEO) source coding problem, many separate encoders observe independently noisy copies of an underlying source. The rate loss is the difference between the rate required in this distributed setting and the rate…

Information Theory · Computer Science 2022-02-04 Arda Atalik , Alper Köse , Michael Gastpar

We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digital aspects of the compression. Furthermore, this architecture…

Information Theory · Computer Science 2008-02-09 Aaron B. Wagner , Saurabha Tavildar , Pramod Viswanath

We consider rate-distortion with two decoders, each with distinct side information. This problem is well understood when the side information at the decoders satisfies a certain degradedness condition. We consider cases in which this…

Information Theory · Computer Science 2016-12-13 Sinem Unal , Aaron B. Wagner
‹ Prev 1 2 3 10 Next ›