Abstract— A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studie...

We derive the ergodic capacity region for a fading broadcast channel when the transmitter knows only the channel ordering information of the users and the receiver knows its transmitter-receiver channel gain and the ordering information at any time instant. We show that superposition coding based on the ordering information achieves the ergodic capacity region. Moreover, we prove that as the nu...

The capacity region of a multiple access channel is discussed. It was found that orthogonal multiple access and non orthogonal multiple access have the same capacity region under the constraint of same sum power.

A special case of the discrete memoryless cooperative broadcast channel, as defined by Dabora and Servetto, is investigated. The capacity region is provided in the case where the information messages are sent over a deterministic broadcast channel (Y1, Y2) = h(X) with a (C12, C21)-admissible conference link between the receivers. In this framework we also give the capacity in the single common ...

This study investigates the capacity region of a three-user cognitive radio network with two primary users and one cognitive user. A three-user Cognitive Interference Channel (C-IFC) is proposed by considering a three-user Interference Channel (IFC) where one of the transmitters has cognitive capabilities and knows the messages of the other two transmitters in a non-causal manner. First, two in...

For integers d and k satisfying 0 d k, a binary sequence is said to satisfy a one-dimensional (d; k) run length constraint if there are never more than k zeros in a row, and if between any two ones there are at least d zeros. For n 1, the n-dimensional (d; k)-constrained capacity is defined as C(n) d;k = lim m1;m2;:::;mn!1 log2N (n;d;k) m1;m2;:::;mn m1m2 mn where N (n;d;k) m1;m2;:::;mn denotes ...

We derive the two-user capacity region with and without common information for a Gaussian broadcast channel with intersymbol interference, assuming colored Gaussian noise and an input power constraint. The proof is achieved by rst deening a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for p...

In this paper, we present a general formula for the capacity region of a general interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is determined by a pair of spectral inf-mutual information rates. Although the presented formula is usually difficult to compute, it provides us useful insights into ...

We consider multi-hop multiple access (MAC) and broadcast channels (BC) where communication takes place with the assistance of relays that amplify and forward (AF) their received signals. For a two hop parallel AF relay MAC, assuming a sum power constraint across all relays we characterize optimal relay amplification factors and the resulting capacity regions. We find the sum rate capacity and ...