English
Related papers

Related papers: Joint Wyner-Ziv/Dirty Paper coding by modulo-latti…

200 papers

It is well known that lossless compression of a discrete memoryless source with near-uniform encoder output is possible at a rate above its entropy if and only if the encoder is randomized. This work focuses on deriving conditions for…

Information Theory · Computer Science 2016-07-12 Badri N Vellambi , Joerg Kliewer , Matthieu Bloch

In this work, we address the lossy quantum-classical source coding with the quantum side-information (QC-QSI) problem. The task is to compress the classical information about a quantum source, obtained after performing a measurement while…

Information Theory · Computer Science 2025-02-18 Mohammad Aamir Sohail , Touheed Anwar Atif , S. Sandeep Pradhan

Remarkable mathematical properties of the integrable nonlinear Schr\"odinger equation (NLSE) can offer advanced solutions for the mitigation of nonlinear signal distortions in optical fibre links. Fundamental optical soliton, continuous and…

Exactly Solvable and Integrable Systems · Physics 2017-06-07 L. L. Frumin , A. A. Gelash , S. K. Turitsyn

We investigate the Wyner-Ziv coding in which the statistics of the principal source is known but the statistics of the channel generating the side-information is unknown except that it is in a certain class. The class consists of channels…

Information Theory · Computer Science 2013-05-06 Shun Watanabe , Shigeaki Kuzuoka

In this paper we study the Z channel with side information non-causally available at the encoders. We use Marton encoding along with Gelfand-Pinsker random binning scheme and Chong-Motani-Garg-El Gamal (CMGE) jointly decoding to find an…

Information Theory · Computer Science 2015-06-03 Saeed Hajizadeh , Mostafa Monemizadeh

The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source,…

Information Theory · Computer Science 2008-10-15 Nan Liu , Deniz Gunduz , Andrea J. Goldsmith , H. Vincent Poor

Scalar quantization and probabilistic shaping are applied to the distributed source coding of Gaussian sources, with mean-square error distortion. A coding scheme with a modulo interval, dithering, and truncated Gaussian shaping is shown to…

Information Theory · Computer Science 2026-04-21 Muhammed Yusuf Sener , Gerhard Kramer , Shlomo Shamai , Ronald Böhnke , Wen Xu

A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…

Information Theory · Computer Science 2024-04-25 M. Yusuf Şener , Gerhard Kramer , Shlomo Shamai , Ronald Böhnke , Wen Xu

Advancing over up-to-date information theoretic results that assume symmetric correlation models, in this work we consider the problem of lossy binary source coding with side information, where the correlation is expressed by a generic…

Information Theory · Computer Science 2016-11-17 Andrei Sechelea , Samuel Cheng , Adrian Munteanu , Nikos Deligiannis

We investigate the problem of the successive refinement for Wyner-Ziv coding with degraded side information and obtain a complete characterization of the rate region for the quadratic vector Gaussian case. The achievability part is based on…

Information Theory · Computer Science 2020-02-19 Yinfei Xu , Xuan Guang , Jian Lu , Jun Chen

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv…

Information Theory · Computer Science 2013-02-11 Behzad Ahmadi , Osvaldo Simeone

We propose a framework for second-order achievability, called type deviation convergence, that is generally applicable to settings in network information theory, and is especially suitable for lossy source coding and channel coding with…

Information Theory · Computer Science 2025-10-24 Xiang Li , Cheuk Ting Li

We consider a network of two nodes separated by a noisy channel with two-sided state information, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of non-causal encoding and…

Information Theory · Computer Science 2020-09-04 Giulia Cervia , Laura Luzzi , Maël Le Treust , Matthieu R. Bloch

A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…

Information Theory · Computer Science 2009-04-14 Tal Philosof , Ram Zamir , Uri Erez , Ashish Khisti

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

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good…

Information Theory · Computer Science 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

We study the theoretical performance of a combined approach to demodulation and decoding of binary continuous-phase modulated signals under repetition-like codes. This technique is motivated by a need to transmit packetized or framed data…

Information Theory · Computer Science 2014-04-28 Gaurav Thakur

In this paper the multicasting of independent parallel Gaussian sources over a binary erasure broadcasted channel is considered. Multiresolution embedded quantizer and layered joint source-channel coding schemes are used in order to serve…

Information Theory · Computer Science 2009-01-19 Ozgun Y. Bursalioglu , Maria Fresia , Giuseppe Caire , H. Vincent Poor

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

We consider a wireless sensors network scenario where two nodes detect correlated sources and deliver them to a central collector via a wireless link. Differently from the Slepian-Wolf approach to distributed source coding, in the proposed…

Information Theory · Computer Science 2007-07-13 A. Abrardo