English
Related papers

Related papers: Source Coding Problems with Conditionally Less Noi…

200 papers

We present a new inner bound for the rate region of the $t$-stage successive-refinement problem with side-information. We also present a new upper bound for the rate-distortion function for lossy-source coding with multiple decoders and…

Information Theory · Computer Science 2016-11-17 Roy Timo , Terence Chan , Alexander Grant

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

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

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

A secrecy system with side information at the decoders is studied in the context of lossy source compression over a noiseless broadcast channel. The decoders have access to different side information sequences that are correlated with the…

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

In this work, we establish a full single-letter characterization of the rate-distortion region of an instance of the Gray-Wyner model with side information at the decoders. Specifically, in this model an encoder observes a pair of…

Information Theory · Computer Science 2018-02-14 Meryem Benammar , Abdellatif Zaidi

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

The problem of lossless data compression with side information available to both the encoder and the decoder is considered. The finite-blocklength fundamental limits of the best achievable performance are defined, in two different versions…

Information Theory · Computer Science 2021-02-23 Lampros Gavalakis , Ioannis Kontoyiannis

We consider a secure source coding problem with side information (S.I.) at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate limited link to a legitimate decoder.…

Information Theory · Computer Science 2013-07-04 Yeow-Khiang Chia , Kittipong Kittichokechai

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 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

Secure data compression in the presence of side information at both a legitimate receiver and an eavesdropper is explored. A noise-free, limited rate link between the source and the receiver, whose output can be perfectly observed by the…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor

This paper investigates the problem of source-channel coding for secure transmission with arbitrarily correlated side informations at both receivers. This scenario consists of an encoder (referred to as Alice) that wishes to compress a…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

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

For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three…

Information Theory · Computer Science 2016-11-18 Behzad Ahmadi , Ravi Tandon , Osvaldo Simeone , H. Vincent Poor

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

In this paper, we introduce new lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a…

Information Theory · Computer Science 2014-11-18 Avraham Reani , Neri Merhav

A lossy source coding problem is studied in which a source encoder communicates with two decoders, one with and one without correlated side information with an additional constraint on the privacy of the side information at the uninformed…

Information Theory · Computer Science 2011-06-13 Ravi Tandon , Lalitha Sankar , H. Vincent Poor

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 paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

Information Theory · Computer Science 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore
‹ Prev 1 2 3 10 Next ›