English
Related papers

Related papers: Nonanticipative Rate Distortion Function for Gener…

200 papers

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 paper, we analyze the indirect source coding problem with side information at both the encoder and decoder, as well as only at the decoder. We first derive structural properties of the two rate distortion functions (RDFs) for…

Information Theory · Computer Science 2024-10-14 Evagoras Stylianou , Michail Gkagkos , Charalambos D. Charalambous

For memoryless sources, delayed side information at the decoder does not improve the rate-distortion function. However, this is not the case for more general sources with memory, as demonstrated by a number of works focusing on the special…

Information Theory · Computer Science 2012-07-19 Osvaldo Simeone , Haim H. Permuter

Consider a discrete memoryless multiple source with $m$ components of which $k \leq m$ possibly different sources are sampled at each time instant and jointly compressed in order to reconstruct all the $m$ sources under a given distortion…

Information Theory · Computer Science 2016-07-15 Vinay Praneeth Boda , Prakash Narayan

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

In this paper, we consider the mismatched rate-distortion problem, in which the encoding is done using a codebook, and the encoder chooses the minimum-distortion codeword according to a mismatched distortion function that differs from the…

Information Theory · Computer Science 2022-12-20 Millen Kanabar , Jonathan Scarlett

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the…

Information Theory · Computer Science 2014-02-05 Victoria Kostina , Sergio Verdú

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

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

In image compression, with recent advances in generative modeling, the existence of a trade-off between the rate and the perceptual quality (realism) has been brought to light, where the realism is measured by the closeness of the output…

Information Theory · Computer Science 2024-04-02 Yassine Hamdi , Aaron B. Wagner , Deniz Gündüz

This paper analyzes the effect of adding a pre-decoder processing function to a receiver that contains a fixed mismatched decoder at the output of a discrete memoryless channel. We study properties of the symbolwise pre-processing function…

Information Theory · Computer Science 2024-06-26 Jonathan Solel , Anelia Somekh-Baruch

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

In some rate-distortion-type problems, the required fidelity of information is affected by past actions. As a result, the distortion function depends not only on the instantaneous distortion between a source symbol and its representation…

Information Theory · Computer Science 2026-01-30 Hamidreza Abin , Amin Gohari , Andrew W. Eckford

In this paper, we investigate the rate-distortion-perception function (RDPF) of a source modeled by a Gaussian Process (GP) on a measure space $\Omega$ under mean squared error (MSE) distortion and squared Wasserstein-2 perception metrics.…

Information Theory · Computer Science 2025-01-14 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

An effective 'on-the-fly' mechanism for stochastic lossy coding of Markov sources using string matching techniques is proposed in this paper. Earlier work has shown that the rate-distortion bound can be asymptotically achieved by a 'natural…

Information Theory · Computer Science 2023-01-18 Ahmed Elshafiy , Kenneth Rose

We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be…

Information Theory · Computer Science 2019-04-09 Lan V. Truong , Vincent Y. F. Tan

In this paper, we consider the rate-distortion-perception (RDP) trade-off for the lossy compression of a Bernoulli vector source, which is a finite collection of independent binary random variables. The RDP function quantifies in a way the…

Information Theory · Computer Science 2025-01-22 Praneeth Kumar Vippathalla , Mihai-Alin Badiu , Justin P. Coon

This paper derives an achievable rate-distortion (R-D) region for the state-dependent discrete memoryless multiple access channel (SD-DMMAC), where the generalized feedback and causal side information are present at encoders, and the…

Information Theory · Computer Science 2024-09-27 Xinyang Li , Vlad C. Andrei , Ullrich J. Mönich , Holger Boche

In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a…

Information Theory · Computer Science 2014-06-05 Adel Zahedi , Jan Ostergaard , Soren Holdt Jensen , Patrick Naylor , Soren Bech

We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. The rate distortion function indicating the trade-off between the rate on the data compression and the quality of data…

Information Theory · Computer Science 2016-04-27 Yasutada Oohama