Related papers: On the Compound Broadcast Channel: Multiple Descri…
For a multi-user interference channel with multi-antenna transmitters and single-antenna receivers, by restricting each transmitter to Gaussian input and each receiver to a single-user detector, computing the largest achievable rate region…
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…
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…
The $K$-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends $K$ messages to $K$ receivers, and the channel quality gradually degrades from receiver $K$ to receiver 1. Each…
This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…
This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user. Specifically, the information messages…
We consider the scenario of communicating on a $3\mhyphen$user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a…
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…
The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…
This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…
A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…
Korner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Korner-Marton region to more than 2 receivers…
We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they…
This paper considers the cognitive interference channel (CIC) with two transmitters and two receivers, in which the cognitive transmitter non-causally knows the message and codeword of the primary transmitter. We first introduce a discrete…
For a multi-user interference channel with multi-antenna transmitters and single-antenna receivers, by restricting each receiver to a single-user detector, computing the largest achievable rate region amounts to solving a family of…
The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity…
We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…
In this paper, the Interference Network with General Message Sets (IN-GMS) is introduced in which several transmitters send messages to several receivers: Each subset of transmitters transmit an individual message to each subset of…
Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…
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…