An upper bound on the capacity of a primitive three-node discrete memoryless relay channel
is considered, where a source X wants to send information to destination Y with the help of a …

This paper considers a random access system where each sender is in one of two possible
states, active or not active, and the states are only known to the common receiver. Active …

We consider a time-slotted multiple access noise-free channel where, the received and
transmit alphabets belong to a finite field and the transmitters interfere additively over that …

This paper 1 considers a class of multi-channel random access algorithms, where
contending devices may send multiple copies (replicas) of their messages to the central …

We address the problem of coding for classical multiple-access channels (MACs) with the
assistance of non-signaling correlations between parties. It is well-known that non-signaling …

An instructive counterexample is presented showing that the coding strategy of Cover, El
Gamal, and Salehi for multiple access channels with arbitrarily correlated sources is not …

We develop a new upper bound on the capacity of the relay channel that is tighter than
previously known upper bounds. This upper bound is proved using traditional weak …

In this paper we consider a network that consists of two senders and two receivers. We
further assume that each sender could act as a relay for other communications. The channel …

Consider a random access communication scenario over a channel whose operation is
defined for any number of possible transmitters. Inspired by the model recently introduced …

We consider the problem of multiterminal source-channel communication where a number
of distributed and possibly correlated sources are transmitted through an orthogonal multiple …