English
Related papers

Related papers: Minimum Expected Distortion in Gaussian Source Cod…

200 papers

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

We consider lossy source coding when side information affecting the distortion measure may be available at the encoder, decoder, both, or neither. For example, such distortion side information can model reliabilities for noisy measurements,…

Information Theory · Computer Science 2014-11-17 Emin Martinian , Gregory W. Wornell , Ram Zamir

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

We consider the Cascade and Triangular rate-distortion problems where the same side information is available at the source node and User 1, and the side information available at User 2 is a degraded version of the side information at the…

Information Theory · Computer Science 2010-10-20 Yeow Khiang Chia , Haim Permuter , Tsachy Weissman

We investigate the Wyner-Ziv coding in which the statistics of the principal source is known but the statistics of the channel generating the side-information is unknown except that it is in a certain class. The class consists of channels…

Information Theory · Computer Science 2013-05-06 Shun Watanabe , Shigeaki Kuzuoka

We investigate distributed source coding of two correlated sources X and Y where messages are passed to a decoder in a cascade fashion. The encoder of X sends a message at rate R_1 to the encoder of Y. The encoder of Y then sends a message…

Information Theory · Computer Science 2009-05-13 Paul Cuff , Han-I Su , Abbas El Gamal

The distortion-rate function of output-constrained lossy source coding with limited common randomness is analyzed for the special case of squared error distortion measure. An explicit expression is obtained when both source and…

Information Theory · Computer Science 2024-03-25 Li Xie , Liangyan Li , Jun Chen , Zhongshan Zhang

A scenario involving a source, a channel, and a destination, where the destination is interested in {\em both} reliably reconstructing the message transmitted by the source and estimating with a fidelity criterion the state of the channel,…

Information Theory · Computer Science 2011-08-30 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an…

Information Theory · Computer Science 2009-03-20 Shraga Bross , Amos Lapidoth , Stephan Tinguely

In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the…

Information Theory · Computer Science 2010-08-03 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

The problem of joint source-channel coding is considered for a stationary remote (noisy) Gaussian source and a Gaussian channel. The encoder and decoder are assumed to be causal and their combined operations are subject to a delay…

Information Theory · Computer Science 2012-03-29 Erik Johannesson , Anders Rantzer , Bo Bernhardsson , Andrey Ghulchak

A lossy source coding problem is studied in which a source encoder communicates with two decoders, one with and one without correlated side information with an additional constraint on the privacy of the side information at the uninformed…

Information Theory · Computer Science 2011-06-13 Ravi Tandon , Lalitha Sankar , H. Vincent Poor

Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear…

Information Theory · Computer Science 2007-07-25 D. Krithivasan , S. S. Pradhan

We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for these problems. For the…

Information Theory · Computer Science 2010-01-12 Haim Permuter , Tsachy Weissman

Jointly Gaussian memoryless sources are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction of any one of the observations, say the first one, at the…

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

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv…

Information Theory · Computer Science 2013-02-11 Behzad Ahmadi , Osvaldo Simeone

We consider transmission of a continuous amplitude source over an L-block Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's…

Information Theory · Computer Science 2007-11-09 Deniz Gunduz , Elza Erkip

This paper investigates the problem of source-channel coding for secure transmission with arbitrarily correlated side informations at both receivers. This scenario consists of an encoder (referred to as Alice) that wishes to compress a…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

The amount of information lost in sub-Nyquist sampling of a continuous-time Gaussian stationary process is quantified. We consider a combined source coding and sub-Nyquist reconstruction problem in which the input to the encoder is a noisy…

Information Theory · Computer Science 2016-01-26 Alon Kipnis , Andrea J. Goldsmith , Yonina C. Eldar , Tsachy Weissman