English
Related papers

Related papers: Computing the Rate-Distortion Function of Gray-Wyn…

200 papers

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations,…

Information Theory · Computer Science 2017-03-02 Gil Katz , Pablo Piantanida , Mérouane Debbah

We consider the problem of distributed lossy linear function computation in a tree network. We examine two cases: (i) data aggregation (only one sink node computes) and (ii) consensus (all nodes compute the same function). By quantifying…

Information Theory · Computer Science 2017-01-16 Yaoqing Yang , Pulkit Grover , Soummya Kar

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding…

Information Theory · Computer Science 2011-02-15 Amir Ingber , Yuval Kochman

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

A secrecy system with side information at the decoders is studied in the context of lossy source compression over a noiseless broadcast channel. The decoders have access to different side information sequences that are correlated with the…

Information Theory · Computer Science 2014-10-07 Eva C. Song , Paul Cuff , H. Vincent Poor

We study the compression of data in the case where the useful information is contained in a set rather than a vector, i.e., the ordering of the data points is irrelevant and the number of data points is unknown. Our analysis is based on…

Information Theory · Computer Science 2018-05-23 Günther Koliander , Dominic Schuhmacher , Franz Hlawatsch

We examine the coordinated and universal rate-efficient sampling of a subset of correlated discrete memoryless sources followed by lossy compression of the sampled sources. The goal is to reconstruct a predesignated subset of sources within…

Information Theory · Computer Science 2017-06-23 Vinay Praneeth Boda , Prakash Narayan

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

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean…

Information Theory · Computer Science 2022-06-06 Siyao Zhou , Sadaf Salehkalaibar , Jingjing Qian , Jun Chen , Wuxian Shi , Yiqun Ge , Wen Tong

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

The Gray and Wyner lossy source coding for a simple network for sources that generate a tuple of jointly Gaussian random variables (RVs) $X_1 : \Omega \rightarrow {\mathbb R}^{p_1}$ and $X_2 : \Omega \rightarrow {\mathbb R}^{p_2}$, with…

Information Theory · Computer Science 2020-01-22 Charalambos D. Charalambous , Jan H. van Schuppen

A fundamental question in designing lossy data compression schemes is how well one can do in comparison with the rate-distortion function, which describes the known theoretical limits of lossy compression. Motivated by the empirical success…

Information Theory · Computer Science 2024-03-05 Eric Lei , Hamed Hassani , Shirin Saeedi Bidokhti

In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within…

Information Theory · Computer Science 2008-08-21 Dinesh Krithivasan , S. Sandeep Pradhan

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

We prove achievability of the recently characterized quadratic Gaussian rate-distortion function (RDF) subject to the constraint that the distortion is uncorrelated to the source. This result is based on shaped dithered lattice quantization…

Information Theory · Computer Science 2008-07-24 Milan S. Derpich , Jan Ostergaard , Daniel E. Quevedo

Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently developed algorithmic rate-distortion theory. The latter is based…

Information Theory · Computer Science 2007-07-16 Steven de Rooij , Paul Vitanyi

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

New bounds on the rate distortion function of certain non-Gaussian sources, with a proportional-weighted mean-square error (MSE) distortion measure, are given. The growth, g, of the rate distortion function, as a result of changing from a…

Information Theory · Computer Science 2007-07-13 Jacob Binia

In this paper, we propose a novel function named Rate Distortion-in-Distortion (RDD) function as an extension of the classical rate-distortion (RD) function, where the expected distortion constraint is replaced by a Gromov-type distortion.…

Information Theory · Computer Science 2025-07-25 Lingyi Chen , Haoran Tang , Shitong Wu , Jiakun Liu , Huihui Wu , Wenyi Zhang , Hao Wu

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