English
Related papers

Related papers: The Capacity of Less Noisy Cognitive Interference …

200 papers

The cognitive interference channel with confidential messages (CICC) proposed by Liang et. al. is investigated. When the security is considered in coding systems, it is well known that the sender needs to use a stochastic encoding to avoid…

Information Theory · Computer Science 2012-04-26 Shun Watanabe , Yasutada Oohama

Consider a memoryless degraded broadcast channel (DBC) in which the channel output is a single-letter function of the channel input and the channel noise. As examples, for the Gaussian broadcast channel (BC) this single-letter function is…

Information Theory · Computer Science 2011-10-25 Bike Xie , Thomas Courtade , Richard D. Wesel

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

Information Theory · Computer Science 2016-11-17 Andrew Thangaraj

We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference;…

Information Theory · Computer Science 2016-11-17 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel…

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

We study the capacity region of the two-user Binary Fading (or Erasure) Interference Channel where the transmitters have no knowledge of the channel state information. We develop new inner-bounds and outer-bounds for this problem. We…

Information Theory · Computer Science 2017-03-28 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr , Yan Zhu

Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. First the structure of the capacity-achieving input signals is…

Information Theory · Computer Science 2016-11-17 Mustafa Cenk Gursoy , H. Vincent Poor , Sergio Verdu

We consider a cooperative two-user multiaccess channel in which the transmission is controlled by a random state. Both encoders transmit a common message and, one of the encoders also transmits an individual message. We study the capacity…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi , Shlomo Shamai

We investigate the capacity region of multi-user interference channels (IC), where each user encodes multiple sub-user components. By unifying chain-rule decomposition with the Entropy Power Inequality (EPI), we reason that single-user…

Information Theory · Computer Science 2025-01-28 Sagnik Bhattacharya , Abhiram Rao Gorle , Muhammad Ali Mohsin , John M. Cioffi

The randomized fixe-composition with optimal decoding error exponents are studied \cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the…

Information Theory · Computer Science 2016-11-15 Cheng Chang

The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete…

Information Theory · Computer Science 2021-12-03 Johannes Rosenberger , Uzi Pereg , Christian Deppe

We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two…

Information Theory · Computer Science 2016-05-10 Shirin Saeedi Bidokhti , Michèle Wigger , Roy Timo

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

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

The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…

Information Theory · Computer Science 2008-01-09 Abolfazl S. Motahari , Amir K. Khandani

Channel capacity plays a crucial role in the development of modern communication systems as it represents the maximum rate at which information can be reliably transmitted over a communication channel. Nevertheless, for the majority of…

Information Theory · Computer Science 2021-07-08 Nunzio A. Letizia , Andrea M. Tonello

This work investigates the general two-user Compound Broadcast Channel (BC) where an encoder wishes to transmit common and private messages to two receivers while being oblivious to two possible channel realizations controlling the…

Information Theory · Computer Science 2014-10-21 Meryem Benammar , Pablo Piantanida , Shlomo Shamai

In this paper we consider the State-Dependent Wiretap Channel (SD-WC). As the main idea, we model the SD-WC as a Cognitive Interference Channel (CIC), in which the primary receiver acts as an eavesdropper for the cognitive transmitter's…

Information Theory · Computer Science 2016-05-19 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , Mohammad Reza Aref

The Interference Channels (ICs) represent fundamental building blocks of wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two…

Information Theory · Computer Science 2017-02-25 Reza K. Farsani , Amir K. Khandani

In this paper, a new proof for the degrees of freedom (DoF) region of the K-user multiple-input multiple-output (MIMO) broadcast channel (BC) with no channel state information at the transmitter (CSIT) and perfect channel state information…

Information Theory · Computer Science 2014-01-27 Borzoo Rassouli , Chenxi Hao , Bruno Clerckx

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen