English
Related papers

Related papers: Secure Lossy Source Coding with Side Information a…

200 papers

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

The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder---to whom the side information is unavailable---be able to compute the decoder's reconstruction sequence to within some…

Information Theory · Computer Science 2016-11-15 Amos Lapidoth , Andreas Malär , Michèle Wigger

We study a lossy source coding problem with secrecy constraints in which a remote information source should be transmitted to a single destination via multiple agents in the presence of a passive eavesdropper. The agents observe noisy…

Information Theory · Computer Science 2015-02-19 Farshad Naghibi , Somayeh Salimi , Mikael Skoglund

This paper considers the source coding problem with broadcast side information. The side information is sent to two receivers through a noisy broadcast channel. We provide an outer bound of the rate--distortion--bandwidth (RDB) quadruples…

Information Theory · Computer Science 2026-02-19 Yiqi Chen , Holger Boche , Marc Geitz

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

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

Information Theory · Computer Science 2024-05-24 Jiancheng Tang , Qianqian Yang , Deniz Gündüz

In this work, a likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on a soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the…

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

A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region…

Information Theory · Computer Science 2010-04-20 Shigeaki Kuzuoka , Akisato Kimura , Tomohiko Uyematsu

We study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. The aim of the…

Information Theory · Computer Science 2011-08-18 Ersen Ekrem , Sennur Ulukus

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

A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering…

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

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 investigate the combination between causal/zero-delay source coding and information-theoretic secrecy. Two source coding models with secrecy constraints are considered. We start by considering zero-delay perfectly secret lossless…

Information Theory · Computer Science 2013-11-20 Yonatan Kaspi , Neri Merhav

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable…

Information Theory · Computer Science 2007-07-13 Hari Palaiyanur , Anant Sahai

We consider lossy compression of an information source when decoder-only side information may be absent. This setup, also referred to as the Heegard-Berger or Kaspi problem, is a special case of robust distributed source coding. Building…

Information Theory · Computer Science 2024-05-08 Eyyup Tasci , Ezgi Ozyilkan , Oguzhan Kubilay Ulger , Elza Erkip

We consider the problem of revealing/sharing data in an efficient and secure way via a compact representation. The representation should ensure reliable reconstruction of the desired features/attributes while still preserve privacy of the…

Information Theory · Computer Science 2016-05-09 Kittipong Kittichokechai , Giuseppe Caire

We investigate the problem of strategic point-to-point communication with side information at the decoder, in which the encoder and the decoder have mismatched distortion functions. The decoding process is not supervised, it returns the…

Information Theory · Computer Science 2020-09-18 Maël Le Treust , Tristan Tomala

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

In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information available at the intended receiver is considered. The intended receiver is assumed to have a…

Information Theory · Computer Science 2011-10-18 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

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