English
Related papers

Related papers: Carbon Copying Onto Dirty Paper

200 papers

We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel. Each user has partial knowledge of each message as side information. However, unlike classic…

Information Theory · Computer Science 2015-09-02 David T. H. Kao , Mohammad Ali Maddah-Ali , A. Salman Avestimehr

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…

Information Theory · Computer Science 2017-12-19 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

We consider the problem of communicating over the general discrete memoryless broadcast channel (BC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite…

Information Theory · Computer Science 2016-11-17 Ron Dabora , Sergio D. Servetto

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state…

Signal Processing · Electrical Eng. & Systems 2017-12-21 Mohammadreza Darabi

The dirty paper channel (DPC) under a peak amplitude constraint arises in an optical wireless broadcast channel (BC), where the state at one receiver is the transmitted signal intended for the other receiver(s). This paper studies a class…

Information Theory · Computer Science 2023-01-09 Zhenyu Charlus Zhang , Anas Chaaban

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals…

Information Theory · Computer Science 2016-11-18 Matthieu R. Bloch

The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…

Information Theory · Computer Science 2011-02-02 Moritz Wiese , Holger Boche , Igor Bjelaković , Volker Jungnickel

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also another channel with independent additive Gaussian noise (the feedback channel), and the transmitter observes without delay…

Information Theory · Computer Science 2015-01-21 Marat V. Burnashev , Hirosuke Yamamoto

We analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the…

Information Theory · Computer Science 2018-08-30 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…

Information Theory · Computer Science 2008-12-31 G. Chung , S. Sridharan , S. Vishwanath , C. S. Hwang

This paper investigates downlink transmission over a quasi-static fading Gaussian broadcast channel (BC), to model delay-sensitive applications over slowly time-varying fading channels. System performance is characterized by outage…

Information Theory · Computer Science 2007-11-13 Wenyi Zhang , Shivaprasad Kotagiri , J. Nicholas Laneman

When several wireless users are sharing the spectrum, packet collision is a simple, yet widely used model for interference. Under this model, when transmitters cause interference at any of the receivers, their collided packets are discarded…

Information Theory · Computer Science 2016-11-17 Alireza Vahid , Mohammad Ali Maddah-Ali , A. Salman Avestimehr

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

This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An inner bound and two outer bounds on the achievable distortion…

Information Theory · Computer Science 2016-12-13 Lei Yu , Houqiang Li , Chang Wen Chen

We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmitter and (ii) in the presence of side information known only…

Information Theory · Computer Science 2016-09-08 Makesh Pravin Wilson , Krishna Narayanan , Giuseppe Caire

In 6G systems, extremely large-scale antenna arrays operating at terahertz frequencies extend the near-field region to typical user distances from the base station, enabling near-field communication (NFC) with fine spatial resolution…

Information Theory · Computer Science 2025-11-21 Akash Kulkarni , Rajshekhar V Bhat

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 first propose two coding schemes for the discrete…

Information Theory · Computer Science 2015-03-19 Lili Zhang , Jinhua Jiang , Shuguang Cui

When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted…

Information Theory · Computer Science 2011-03-01 Bobak Nazer , Michael Gastpar

A simple method to enhance the quality of communication is to send a carrier with its copies. Classical information theory says that information behaves quantitatively under copying. In other words, if a carrier is more informatic than…

Quantum Physics · Physics 2020-09-04 Jisho Miyazaki