English
Related papers

Related papers: Incremental Refinements and Multiple Descriptions …

200 papers

This paper is concerned with quantum data compression of asymptotically many independent and identically distributed copies of ensembles of mixed quantum states. The encoder has access to a side information system. The figure of merit is…

Quantum Physics · Physics 2024-06-21 Zahra Baghali Khanian , Kohdai Kuroiwa , Debbie Leung

In this paper we analyze the joint rate distortion function (RDF), for a tuple of correlated sources taking values in abstract alphabet spaces (i.e., continuous) subject to two individual distortion criteria. First, we derive structural…

Information Theory · Computer Science 2021-05-11 Evagoras Stylianou , Charalambos D. Charalambous , Themistoklis Charalambous

A composite source, consisting of multiple subsources and a memoryless switch, outputs one symbol at a time from the subsource selected by the switch. If some data should be encoded more accurately than other data from an information…

Information Theory · Computer Science 2024-11-14 Jiakun Liu , H. Vincent Poor , Iickho Song , Wenyi Zhang

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of $2^K-1$ information sources, ordered in a decreasing level of importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$ decoders,…

Information Theory · Computer Science 2009-11-13 Soheil Mohajer , Chao Tian , Suhas N. Diggavi

We consider the $k$-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the…

Information Theory · Computer Science 2019-05-22 Lin Zhou , Alfred Hero

In successive refinement of information, the decoder refines its representation of the source progressively as it receives more encoded bits. The rate-distortion region of successive refinement describes the minimum rates required to attain…

Information Theory · Computer Science 2018-11-22 Victoria Kostina , Ertem Tuncel

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 this paper we consider the separate coding problem for $L+1$ correlated Gaussian memoryless sources. We deal with the case where $L$ separately encoded data of sources work as side information at the decoder for the reconstruction of the…

Information Theory · Computer Science 2024-08-29 Yasutada Oohama

We derive a simple general parametric representation of the rate-distortion function of a memoryless source, where both the rate and the distortion are given by integrals whose integrands include the minimum mean square error (MMSE) of the…

Information Theory · Computer Science 2010-04-30 Neri Merhav

In this work, we investigate an instance of the Heegard-Berger problem with two sources and arbitrarily correlated side information sequences at two decoders, in which the reconstruction sets at the decoders are degraded. Specifically, two…

Information Theory · Computer Science 2015-08-27 Meryem Benammar , Abdellatif Zaidi

We improve the existing achievable rate regions for causal and for zero-delay source coding of stationary Gaussian sources under an average mean squared error (MSE) distortion measure. To begin with, we find a closed-form expression for the…

Information Theory · Computer Science 2011-05-03 Milan S. Derpich , Jan Østergaard

Consider a generalized multiterminal source coding system, where $\ell\choose m$ encoders, each observing a distinct size-$m$ subset of $\ell$ ($\ell\geq 2$) zero-mean unit-variance symmetrically correlated Gaussian sources with correlation…

Information Theory · Computer Science 2017-10-16 Jun Chen , Li Xie , Yameng Chang , Jia Wang , Yizhong Wang

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 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

The transmission of a Gaussian source over a block-fading multiple antenna channel in the presence of a feedback link is considered. The feedback link is assumed to be an error and delay free link of capacity 1 bit per channel use. Under…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

A receiver wants to compute a function of two correlated sources separately observed by two transmitters. One of the transmitters may send a possibly private message to the other transmitter in a cooperation phase before both transmitters…

Information Theory · Computer Science 2015-04-08 Milad Sefidgaran , Aslan Tchamkerten

We study the problem of computing the rate-distortion function for sources with feed-forward and the capacity for channels with feedback. The formulas (involving directed information) for the optimal rate-distortion function with…

Information Theory · Computer Science 2007-07-18 Ramji Venkataramanan , S. Sandeep Pradhan

This paper deals with rate distortion or source coding with fidelity criterion, in measure spaces, for a class of source distributions. The class of source distributions is described by a relative entropy constraint set between the true and…

Information Theory · Computer Science 2013-05-07 Farzad Rezaei , Charalambos D. Charalambous , Photios A. Stavrou

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

Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides…

Information Theory · Computer Science 2016-11-17 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan