English
Related papers

Related papers: Rate Region of the Vector Gaussian One-Helper Sour…

200 papers

The three-node multiterminal lossy source coding problem is investigated. We derive an inner bound to the general rate-distortion region of this problem which is a natural extension of the seminal work by Kaspi'85 on the interactive…

Information Theory · Computer Science 2016-01-19 Leonardo Rey Vega , Pablo Piantanida , Alfred Hero

Quantum random variable, distortion operator are introduced based on canonical operators. As the lower bound of rate distortion, the entanglement information rate distortion is achieved by Gaussian map for Gaussian source. General Gaussian…

Quantum Physics · Physics 2007-05-23 Xiao-yu Chen

One-shot achievable rate region for source coding when coded side information is available at the decoder (source coding with a helper) is proposed. The achievable region proposed is in terms of conditional smooth max Renyi entropy and…

Information Theory · Computer Science 2013-03-12 Naqueeb Ahmad Warsi

We consider the distributed source coding system of $L$ correlated Gaussian sources $Y_i,i=1,2,...,L$ which are noisy observations of correlated Gaussian remote sources $X_k, k=1,2,...,K$. We assume that $Y^{L}={}^{\rm t}(Y_1,Y_2,$ $...,…

Information Theory · Computer Science 2011-02-21 Yasutada Oohama

For a number of lossy source coding problems it is shown that even if the usual single-letter sum-rate-distortion expressions may become invalid for non-infinite distortion functions, they can be approached, to any desired accuracy, via the…

Information Theory · Computer Science 2014-08-05 Prakash Ishwar

Sparse representation leads to an efficient way to approximately recover a signal by the linear composition of a few bases from a learnt dictionary, based on which various successful applications have been achieved. However, in the scenario…

Computer Vision and Pattern Recognition · Computer Science 2018-05-04 Xiang Zhang , Jiarui Sun , Siwei Ma , Zhouchen Lin , Jian Zhang , Shiqi Wang , Wen Gao

The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are the correlated random variables used for secure source reconstruction. The main additions to the problem…

Information Theory · Computer Science 2022-11-10 Onur Günlü , Rafael F. Schaefer , Holger Boche , H. Vincent Poor

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

We consider the classical two-encoder multiterminal source coding problem where distortion is measured under logarithmic loss. We provide a single-letter characterization of the achievable rate distortion region for arbitrarily correlated…

Information Theory · Computer Science 2012-07-12 Thomas Courtade , Tsachy Weissman

In this paper, we study the zero-delay source-channel coding problem, and specifically the problem of obtaining the vector transformations that optimally map between the m-dimensional source space and the k-dimensional channel space, under…

Information Theory · Computer Science 2016-11-15 Emrah Akyol , Kumar Viswanatha , Kenneth Rose , Tor Ramstad

We consider the multi-user lossy source-coding problem for continuous alphabet sources. In a previous work, Ziv proposed a single-user universal coding scheme which uses uniform quantization with dither, followed by a lossless source…

Information Theory · Computer Science 2014-11-14 Avraham Reani , Neri Merhav

We study the vector Gaussian CEO problem, where there are an arbitrary number of agents each having a noisy observation of a vector Gaussian source. The goal of the agents is to describe the source to a central unit, which wants to…

Information Theory · Computer Science 2012-02-03 Ersen Ekrem , Sennur Ulukus

This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the encoder is allowed to observe only…

Information Theory · Computer Science 2013-07-22 Xi Liu , Osvaldo Simeone , Elza Erkip

This paper studies a variant of the rate-distortion problem motivated by task-oriented semantic communication and distributed learning systems, where $M$ correlated sources are independently encoded for a central decoder. The decoder has…

Information Theory · Computer Science 2025-01-24 Jiancheng Tang , Qianqian Yang

For a Gaussian source under mean-squared error (MSE), classical transform coding is rate--distortion (RD) optimal: the Karhunen--Loeve transform (KLT) diagonalizes the covariance, reverse waterfilling allocates the bits, and scalar…

Information Theory · Computer Science 2026-05-18 Bumsu Park , Chanho Park , Youngmok Park , Namyoon Lee

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…

Information Theory · Computer Science 2024-03-01 Deheng Yuan , Tao Guo , Zhongyi Huang , Shi Jin

This paper studies a variant of the rate-distortion problem motivated by task-oriented semantic communication and distributed learning problems, where $M$ correlated sources are independently encoded for a central decoder. The decoder has…

Information Theory · Computer Science 2024-05-24 Jiancheng Tang , Qianqian Yang , Deniz Gündüz

The "water-filling" solution for the quadratic rate-distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain "test-channel" realization. We…

Information Theory · Computer Science 2008-02-18 Ram Zamir , Yuval Kochman , Uri Erez

We investigate the secret key agreement from correlated vector Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show…

Information Theory · Computer Science 2011-09-29 Shun Watanabe , Yasutada Oohama

We study a class of $K$-encoder hypothesis testing against conditional independence problems. Under the criterion that stipulates minimization of the Type II error subject to a (constant) upper bound $\epsilon$ on the Type I error, we…

Information Theory · Computer Science 2022-07-05 Abdellatif Zaidi