English
Related papers

Related papers: Multicoding Schemes for Interference Channels

200 papers

This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another. Achievable rate regions are derived based on a combination of Han-Kobayashi common-private information splitting…

Information Theory · Computer Science 2012-04-26 Lei Zhou , Wei Yu

The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…

Quantum Physics · Physics 2016-05-10 Marco Tomamichel , Mario Berta , Joseph M. Renes

This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic…

Information Theory · Computer Science 2016-04-12 Parthajit Mohapatra , Chandra R. Murthy , Jemin Lee

Allowing the input auxiliary random variables to be correlated and using the binning scheme, the Han- Kobayashi (HK) rate region for general interference channel is improved. The obtained new achievable rate region (i) is shown to encompass…

Information Theory · Computer Science 2010-08-26 Ghosheh Abed Hodtani

In this paper, it is shown that for any given single-hop communication network with two receivers, splitting messages into more than two sub-messages in a random coding scheme is redundant. To this end, the Broadcast Channel with Cognitive…

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

A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…

Information Theory · Computer Science 2014-03-31 Ramji Venkataramanan , S. Sandeep Pradhan

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

Information Theory · Computer Science 2018-09-05 Yimin Pang , Mahesh K. Varanasi

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

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse

We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including…

Information Theory · Computer Science 2016-02-19 Youlong Wu , Michèle Wigger

This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…

Information Theory · Computer Science 2015-03-13 O. Ozan Koyluoglu , Hesham El Gamal

A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with messages intended…

Information Theory · Computer Science 2020-11-11 Henry Romero , Mahesh K. Varanasi

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with…

Information Theory · Computer Science 2011-02-08 Mahdi Zamanighomi , Mohammad Javad Emadi , Farhad Shirani Chaharsooghi , Mohammad Reza Aref

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…

Information Theory · Computer Science 2017-12-08 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…

Information Theory · Computer Science 2016-11-18 Jingge Zhu , Michael Gastpar

The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Xin Yan

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

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

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