English
Related papers

Related papers: Indirect Rate Distortion Functions with Side Infor…

200 papers

We consider correlated and distributed sources without cooperation at the encoder. For these sources, we derive the best achievable performance in the rate-distortion sense of any distributed compressed sensing scheme, under the constraint…

Information Theory · Computer Science 2014-04-10 Giulio Coluccia , Aline Roumy , Enrico Magli

We consider finite blocklength lossy compression of information sources whose components are independent but non-identically distributed. Crucially, Gaussian sources with memory and quadratic distortion can be cast in this form. We show…

Information Theory · Computer Science 2026-02-11 Eyyup Tasci , Victoria Kostina

Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function $R(D)$, then we can transmit this source to within a distortion $D$. We answer the converse question ``If we can transmit a source to…

Information Theory · Computer Science 2007-07-13 Mukul Agarwal , Anant Sahai , Sanjoy Mitter

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

The problem of broadcasting a pair of correlated Gaussian sources using optimal separate source and channel codes is studied. Considerable performance gains over previously known separate source-channel schemes are observed. Although…

Information Theory · Computer Science 2011-05-10 Yang Gao , Ertem Tuncel

The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source,…

Information Theory · Computer Science 2008-10-15 Nan Liu , Deniz Gunduz , Andrea J. Goldsmith , H. Vincent Poor

By optimizing the rate-distortion-realism trade-off, generative compression approaches produce detailed, realistic images, even at low bit rates, instead of the blurry reconstructions produced by rate-distortion optimized models. However,…

Computer Vision and Pattern Recognition · Computer Science 2023-03-31 Eirikur Agustsson , David Minnen , George Toderici , Fabian Mentzer

In problems of lossy source/noisy channel coding with side information, the theoretical bounds are achieved using "good" source/channel codes that can be partitioned into "good" channel/source codes. A scheme that achieves optimality in…

Information Theory · Computer Science 2009-04-07 Lorenzo Cappellari

We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An…

Information Theory · Computer Science 2007-11-13 Chao Tian , Jun Chen , Suhas Diggavi

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

Learned image compression codecs have recently achieved impressive compression performances surpassing the most efficient image coding architectures. However, most approaches are trained to minimize rate and distortion which often leads to…

Computer Vision and Pattern Recognition · Computer Science 2024-03-06 Daniele Mari , Simone Milani

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

In this article we focus on the problem of channel decoding in presence of a-priori information. In particular, assuming that the a-priori information reliability is not perfectly estimated at the receiver, we derive a novel analytical…

Information Theory · Computer Science 2007-11-14 Andrea Abrardo

Achievability and converse results for the lossy transmission of correlated sources over Shannon's two-way channels (TWCs) are presented. A joint source-channel coding theorem for independent sources and TWCs for which adaptation cannot…

Information Theory · Computer Science 2018-05-08 Jian-Jia Weng , Fady Alajaji , Tamás Linder

This work concerns minimizing the achievable distortion of a Gaussian source over a two-hop block fading channel under mean square-error criterion. It is assumed that there is not a direct link between transmission ends and the…

Information Theory · Computer Science 2016-05-31 Sayed Ali Khodam Hoseini , Soroush Akhlaghi , Mina Baghani

We derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data…

Quantum Physics · Physics 2012-12-21 Nilanjana Datta , Min-Hsiu Hsieh , Mark M. Wilde

A conjectural expression of the asymptotic gap between the rate-distortion function of an arbitrary generalized Gaussian multiterminal source coding system and that of its centralized counterpart in the high-resolution regime is proposed.…

Information Theory · Computer Science 2019-08-19 Li Xie , Xiaolan Tu , Siyao Zhou , Jun Chen

In this paper the relation between nonanticipative rate distortion function (RDF) and Bayesian filtering theory is investigated using the topology of weak convergence of probability measures on Polish spaces. The relation is established via…

Information Theory · Computer Science 2013-04-29 Charalambos D. Charalambous , Photios A. Stavrou

We show how real-number codes can be used to compress correlated sources, and establish a new framework for lossy distributed source coding, in which we quantize compressed sources instead of compressing quantized sources. This change in…

Information Theory · Computer Science 2012-06-20 Mojtaba Vaezi , Fabrice Labeau

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner