English
Related papers

Related papers: Noisy DPC and Application to a Cognitive Channel

200 papers

Motivated by DNA-based storage, we study the noisy shuffling channel, which can be seen as the concatenation of a standard noisy channel (such as the BSC) and a shuffling channel, which breaks the data block into small pieces and shuffles…

Information Theory · Computer Science 2019-03-01 Ilan Shomorony , Reinhard Heckel

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

In this paper, we formally define and analyze the class of noisy permutation channels. The noisy permutation channel model constitutes a standard discrete memoryless channel (DMC) followed by an independent random permutation that reorders…

Information Theory · Computer Science 2020-07-16 Anuran Makur

We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly…

Information Theory · Computer Science 2023-10-30 Jennifer Tang , Yury Polyanskiy

Dirty paper codes are a powerful tool for combating known interference. However, there is a significant difference between knowing the transmitted interference sequence and knowing the received interference sequence, especially when the…

Information Theory · Computer Science 2013-05-20 David T. H. Kao , Ashutosh Sabharwal

The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by…

Information Theory · Computer Science 2012-07-16 Fangfang Zhu , Biao Chen

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

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

This paper studies the two-user Causal Cognitive Interference Channel (CCIC), where two transmitters aim to communicate independent messages to two different receivers via a common channel. One source, referred to as the cognitive, is…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp

The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in…

Information Theory · Computer Science 2008-06-09 Hamid Farmanbar , Amir K. Khandani

The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages, is known in several parameter regimes but remains unknown…

Information Theory · Computer Science 2010-07-12 Stefano Rini , Daniela Tuninetti , Natasha Devroye

One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…

Information Theory · Computer Science 2013-02-08 Reza K. Farsani

We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression [max]\_top(P_U,f(.),X=f(U,S))I(U;Y) is presented for the capacity of this…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani , Bahareh Akhbari , Mohammad Reza Aref

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

Calculating the capacity (with or without feedback) of channels with memory and continuous alphabets is a challenging task. It requires optimizing the directed information (DI) rate over all channel input distributions. The objective is a…

Information Theory · Computer Science 2020-05-19 Ziv Aharoni , Dor Tsur , Ziv Goldfeld , Haim Henry Permuter

The two-user Gaussian interference channel (G-IC) is revisited, with a particular focus on practically amenable discrete input signalling and treating interference as noise (TIN) receivers. The corresponding deterministic interference…

Information Theory · Computer Science 2021-03-18 Min Qiu , Yu-Chih Huang , Jinhong Yuan

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

In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting;…

Information Theory · Computer Science 2018-05-22 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

The cognitive interference channel models cognitive overlay radio systems, where cognitive radios overhear the transmission of neighboring nodes. Capacity for this channel is not known in general. For the Gaussian case capacity is known in…

Information Theory · Computer Science 2012-04-11 Stefano Rini , Ernest Kurniawan , Andrea Goldsmith

We investigate super dense coding in the presence of noise, i.e. the subsystems of the entangled resource state have to pass a noisy unital quantum channel between the sender and the receiver. We discuss explicitly the case of Pauli…

Quantum Physics · Physics 2015-05-18 Zahra Shadman , Hermann Kampermann , Chiara Macchiavello , Dagmar Bruss