English
Related papers

Related papers: Universal Wyner-Ziv Coding for Distortion Constrai…

200 papers

Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) composed of a finite number of subsources with known distributions.…

Information Theory · Computer Science 2016-09-08 Hari Palaiyanur , Cheng Chang , Anant Sahai

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 study the problem of rate-distortion-equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the…

Information Theory · Computer Science 2022-01-25 Hamid Ghourchian , Photios A. Stavrou , Tobias J. Oechtering , Mikael Skoglund

In this paper we provide a new inequality useful for the proofs of strong converse theorems in the multiterminal information theory. We apply this inequality to the recent work by Tyagi and Watanabe on the strong converse theorem for the…

Information Theory · Computer Science 2019-01-18 Yasutada Oohama

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

Information Theory · Computer Science 2023-05-23 Yassine Hamdi , Deniz Gündüz

Transmission of a Gaussian source over a time-varying Gaussian channel is studied in the presence of time-varying correlated side information at the receiver. A block fading model is considered for both the channel and the side information,…

Information Theory · Computer Science 2015-05-27 Iñaki Estella Aguerri , Deniz Gündüz

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

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

A new source model, which consists of an intrinsic state part and an extrinsic observation part, is proposed and its information-theoretic characterization, namely its rate-distortion function, is defined and analyzed. Such a source model…

Information Theory · Computer Science 2022-06-02 Jiakun Liu , Shuo Shao , Wenyi Zhang , H. Vincent Poor

In this paper, we consider the one-shot version of the classical Wyner-Ziv problem where a source is compressed in a lossy fashion when only the decoder has access to a correlated side information. Following the entropy-constrained…

Information Theory · Computer Science 2024-05-06 Oğuzhan Kubilay Ülger , Elza Erkip

A computable expression for the rate-distortion (RD) function proposed by Heegard and Berger has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for…

Information Theory · Computer Science 2012-12-12 Roy Timo , Tobias J. Oechtering , Michèle Wigger

The additive rate-distortion function (ARDF) was developed in order to universally bound the rate loss in the Wyner-Ziv problem, and has since then been instrumental in e.g., bounding the rate loss in successive refinements, universal…

Information Theory · Computer Science 2011-05-26 Jan Ostergaard , Ram Zamir

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

In 1985 Kaspi provided a single-letter characterization of the sum-rate-distortion function for a two-way lossy source coding problem in which two terminals send multiple messages back and forth with the goal of reproducing each other's…

Information Theory · Computer Science 2010-06-02 Nan Ma , Prakash Ishwar

We study error exponents for source coding with side information. Both achievable exponents and converse bounds are obtained for the following two cases: lossless source coding with coded information (SCCSI) and lossy source coding with…

Information Theory · Computer Science 2015-03-19 Benjamin G. Kelly , Aaron B. Wagner

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

We consider lossy compression of an information source when the decoder has lossless access to a correlated one. This setup, also known as the Wyner-Ziv problem, is a special case of distributed source coding. To this day, practical…

Information Theory · Computer Science 2024-05-22 Ezgi Ozyilkan , Johannes Ballé , Elza Erkip

We show the existence of variable-rate rate-distortion codes that meet the disortion constraint almost surely and are minimax, i.e., strongly, universal with respect to an unknown source distribution and a distortion measure that is…

Information Theory · Computer Science 2022-11-29 Adeel Mahmood , Aaron B. Wagner

We consider lossy compression of an information source when the decoder has lossless access to a correlated one. This setup, also known as the Wyner-Ziv problem, is a special case of distributed source coding. To this day, real-world…

Information Theory · Computer Science 2023-05-09 Ezgi Ozyilkan , Johannes Ballé , Elza Erkip

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