English
Related papers

Related papers: Rate Region of the Gaussian Scalar-Help-Vector Sou…

200 papers

In this paper, we consider a scalar-help-vector source coding problem for $L+1$ correlated Gaussian memoryless sources. We deal with the case where $L$ encoders observe noisy linear combinations of $K$ correlated Gaussian scalar sources…

Information Theory · Computer Science 2019-11-14 C. Deng , S. Wu , Q. Zhang

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

This work considers the quadratic Gaussian multiterminal (MT) source coding problem and provides a new sufficient condition for the Berger-Tung sum-rate bound to be tight. The converse proof utilizes a set of virtual remote sources given…

Information Theory · Computer Science 2010-09-13 Yang Yang , Yifu Zhang , Zixiang Xiong

We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…

Information Theory · Computer Science 2013-06-21 Chen Gong , Xiaodong Wang

Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions where a Markov form…

Information Theory · Computer Science 2009-04-06 Haim Permuter , Yossi Steinberg , Tsachy Weissman

For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three…

Information Theory · Computer Science 2016-11-18 Behzad Ahmadi , Ravi Tandon , Osvaldo Simeone , H. Vincent Poor

The problem of sending two correlated vector Gaussian sources over a bandwidth-matched two-user scalar Gaussian broadcast channel is studied in this work, where each receiver wishes to reconstruct its target source under a covariance…

Information Theory · Computer Science 2015-03-11 Lin Song , Jun Chen , Chao Tian

I introduce rate-distortion theory for quantum coding, and derive a lower bound, involving the coherent information, on the rate at which qubits must be used to encode a quantum source with a given maximum level of distortion per source…

Quantum Physics · Physics 2007-05-23 Howard Barnum

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 consider the k-encoder source coding problem with a quadratic distortion measure. We show that among all source distributions with a given covariance matrix K, the jointly Gaussian source requires the highest rates in order to meet a…

Information Theory · Computer Science 2016-11-15 Ilan Shomorony , A. Salman Avestimehr , Himanshu Asnani , Tsachy Weissman

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

We consider the remote vector source coding problem in which a vector Gaussian source is to be estimated from noisy linear measurements. For this problem, we derive the performance of the compress-and-estimate (CE) coding scheme and compare…

Information Theory · Computer Science 2017-07-04 Ruiyang Song , Stefano Rini , Alon Kipnis , Andrea Goldsmith

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

Recently, Tian et al. [1] considered joint source-channel coding of transmitting a Gaussian source over $K$-user Gaussian broadcast channel, and derived an outer bound on the admissible distortion region. In [1], they stated "due to its…

Information Theory · Computer Science 2016-11-17 Lei Yu , Houqiang Li , Weiping Li

We consider the distributed source coding system for $L$ correlated Gaussian observations $Y_i, i=1,2, ..., L$. Let $X_i,i=1,2, ..., L$ be $L$ correlated Gaussian random variables and $N_i,$ $i=1,2,... L$ be independent additive Gaussian…

Information Theory · Computer Science 2009-08-09 Yasutada Oohama

Rate-distortion formulation is the information-theoretic approach to the study of signal encoding systems. Since a more general approach to model the nonstationarity exhibited by real-world signals is to use appropriately fitted time…

Information Theory · Computer Science 2019-11-01 Jia-Chyi Wu

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

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

A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes. It is shown in two different MD set-ups that the linear coding scheme…

Information Theory · Computer Science 2014-02-11 Farhad Shirani , Sandeep Pradhan

In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by…

Information Theory · Computer Science 2018-12-26 Tetsunao Matsuta , Tomohiko Uyematsu