English
Related papers

Related papers: Two-way source coding with a helper

200 papers

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

The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…

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

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

We extend quantum rate distortion theory by considering auxiliary resources that might be available to a sender and receiver performing lossy quantum data compression. The first setting we consider is that of quantum rate distortion coding…

Quantum Physics · Physics 2013-12-09 Mark M. Wilde , Nilanjana Datta , Min-Hsiu Hsieh , Andreas Winter

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete…

Information Theory · Computer Science 2010-06-29 Lili Zhang , Jinhua Jiang , Shuguang Cui

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

This paper is concerned with quantum data compression of asymptotically many independent and identically distributed copies of ensembles of mixed quantum states. The encoder has access to a side information system. The figure of merit is…

Quantum Physics · Physics 2024-06-21 Zahra Baghali Khanian , Kohdai Kuroiwa , Debbie Leung

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

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

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

We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An…

Information Theory · Computer Science 2007-11-13 Chao Tian , Jun Chen , Suhas Diggavi

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

In a cooperative coding scheme, network nodes work together to achieve higher transmission rates. To obtain a better understanding of cooperation, we consider a model in which two transmitters send rate-limited descriptions of their…

Information Theory · Computer Science 2015-04-20 Parham Noorzad , Michelle Effros , Michael Langberg

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 classical two-encoder multiterminal source coding problem where distortion is measured under logarithmic loss. We provide a single-letter characterization of the achievable rate distortion region for arbitrarily correlated…

Information Theory · Computer Science 2012-07-12 Thomas Courtade , Tsachy Weissman

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 investigate two source coding problems with secrecy constraints. In the first problem we consider real--time fully secure transmission of a memoryless source. We show that although classical variable--rate coding is not an option since…

Information Theory · Computer Science 2012-05-16 Yonatan Kaspi , Neri Merhav

We show that the duality between channel capacity and data compression is retained when state information is available to the sender, to the receiver, to both, or to neither. We present a unified theory for eight special cases of channel…

Information Theory · Computer Science 2007-07-13 T. M. Cover , M. Chiang

In the presence of multiple senders, one of the simplest decoding strategies that can be employed by a receiver is successive decoding. In a successive decoding strategy, the receiver decodes the messages one at a time using the knowledge…

Information Theory · Computer Science 2012-07-04 Omar Fawzi , Ivan Savov

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
‹ Prev 1 3 4 5 6 7 10 Next ›