We introduce the communication situation in which the encoders of a multiple access
channel are partially cooperating. These encoders are connected by communication links …

Multiple Access Channels Page 11 Multiple Access Channels 3 E. Biglieri and L. Györfi (Eds.)
IOS Press, 2007 © 2007 IOS Press. All rights reserved. Multiple Access Channels Imre CSISZÁR …

A half-duplex relay channel consisting of two relays in a diamond topology is studied. In
contrast to full-duplex systems, it is shown that time should be optimally allocated among …

We prove the strong converse for the N-source Gaussian multiple access channel. In
particular, we show that any rate tuple that can be supported by a sequence of codes with …

The capacity of a class of discrete-memoryless relay channels with orthogonal channels
from the sender to the relay receiver and from the sender and relay to the receiver is shown …

For the binary erasure multiple access channel, van der Meulen showed in his survey paper
that the symmetrical rate pair (0.79113, 0.79113) is achievable in the ease of feedback. Here …

Outer bounds for the discrete memoryless multiple-access relay channel (MARC) are
obtained that exploit the causal relationship between the source and relay inputs. A novel …

In this paper, the multiple access channel (MAC) with combined cooperation and partial
cribbing is studied, and its capacity region is characterized. Cooperation means that each of …

The capacity region of the multiple access channel with arbitrarily correlated sources
remains an open problem. Cover, El Gamal and Salehi gave an achievable region in the …

The sum-capacity is studied for a K-user physically degraded Gaussian multiple-access
relay channel (MARC). Decode-and-forward (DF) is shown to achieve the sum-capacity and …