English
Related papers

Related papers: Exponent Function for Source Coding with Side Info…

200 papers

This paper investigates the problem of secure lossy source coding in the presence of an eavesdropper with arbitrary correlated side informations at the legitimate decoder (referred to as Bob) and the eavesdropper (referred to as Eve). This…

Information Theory · Computer Science 2011-05-25 Joffrey Villard , Pablo Piantanida

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

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

We consider the problem of rate/distortion with side information available only at the decoder. For the case of jointly-Gaussian source X and side information Y, and mean-squared error distortion, Wyner proved in 1976 that the…

Information Theory · Computer Science 2007-07-16 Sergio D. Servetto

We consider a source coding problem with a network scenario in mind, and formulate it as a remote vector Gaussian Wyner-Ziv problem under covariance matrix distortions. We define a notion of minimum for two positive-definite matrices based…

Information Theory · Computer Science 2016-11-03 Adel Zahedi , Jan Østergaard , Søren Holdt Jensen , Patrick A. Naylor , Søren Bech

The problem of side-information scalable (SI-scalable) source coding is considered in this work, where the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the…

Information Theory · Computer Science 2007-08-01 Chao Tian , Suhas N. Diggavi

Let (S1,i, S2,i), distributed according to i.i.d p(s1, s2), i = 1, 2, . . . be a memoryless, correlated partial side information sequence. In this work we study channel coding and source coding problems where the partial side information…

Information Theory · Computer Science 2013-04-12 Avihay Shirazi , Uria Basher , Haim Permuter

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 introduce the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. We show that such distortion side information is not only useful at the encoder, but that under…

Information Theory · Computer Science 2007-07-16 Emin Martinian , Gregory W. Wornell , Ram Zamir

Past works on remote lossy source coding studied the rate under average distortion and the error exponent of excess distortion probability. In this work, we look into how fast the excess distortion probability converges to 1 at small rates,…

Information Theory · Computer Science 2025-04-24 Han Wu , Hamdi Joudeh

We consider a rate-distortion version of the quantum state redistribution task, where the error of the decoded state is judged via an additive distortion measure; it thus constitutes a quantum generalisation of the classical Wyner-Ziv…

Quantum Physics · Physics 2025-04-11 Zahra Baghali Khanian , Andreas Winter

In this paper, the rate-distortion theory of the Gray-Wyner lossy source coding system is investigated. For the case of jointly Gaussian distributed sources, we establish an expression for the rate-distortion function under the constraint…

Information Theory · Computer Science 2023-03-29 Guojun Chen , Yinfei Xu , Ling Liu , Tiecheng Song , Jing Hu

In the Wyner-Ziv source coding problem, a source $X$ has to be encoded while the decoder has access to side information $Y$. This paper investigates the indirect setup, in which a latent source $S$, unobserved by both the encoder and the…

Information Theory · Computer Science 2025-07-25 Jiahui Wei , Philippe Mary , Elsa Dupraz

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

Information Theory · Computer Science 2025-07-22 Yassine Hamdi , Aaron B. Wagner , Deniz Gündüz

We study source coding in the presence of side information, when the system can take actions that affect the availability, quality, or nature of the side information. We begin by extending the Wyner-Ziv problem of source coding with decoder…

Information Theory · Computer Science 2009-04-30 Tsachy Weissman , Haim H. Permuter

This paper studies a variant of the rate-distortion problem motivated by task-oriented semantic communication and distributed learning systems, where $M$ correlated sources are independently encoded for a central decoder. The decoder has…

Information Theory · Computer Science 2025-01-24 Jiancheng Tang , Qianqian Yang

An encoder, subject to a rate constraint, wishes to describe a Gaussian source under squared error distortion. The decoder, besides receiving the encoder's description, also observes side information consisting of uncompressed source symbol…

Information Theory · Computer Science 2013-05-10 Chris T. K. Ng , Chao Tian , Andrea J. Goldsmith , Shlomo Shamai

We consider the recovery of a continuous-time Wiener process from a quantized or lossy compressed version of its uniform samples under limited bitrate and sampling rate. We derive a closed form expression for the optimal tradeoff among…

Information Theory · Computer Science 2018-07-27 Alon Kipnis , Andrea J. Goldsmith , Yonina C. Eldar

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

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