The Deterministic Multicast Capacity of 4-Node Relay Networks

Abstract

In this paper, we completely characterize the deterministic capacity region of a four-node relay network with no direct links between the nodes, where each node communicates with the three other nodes via a relay. Towards this end, we develop an upper bound on the deterministic capacity region, based on the notion of a one-sided genie. To establish achievability, we use the detour schemes that achieve the upper bound by routing specific bits via indirect paths instead of sending them directly.

5 pages, 2 figures, accepted at ISIT'13

References in corpus (1)

• The Capacity Region of the Linear Shift Deterministic Y-Channel

Cited by in corpus (6)

• Three-Way Channels with Multiple Unicast Sessions: Capacity Approximation via Network Transformation
• Simultaneous Diagonalization: On the DoF Region of the K-user MIMO Multi-way Relay Channel
• The Approximate Capacity Region of the Gaussian Y-Channel
• Achievable Degrees of Freedom Region of the MIMO Relay Networks using the Detour Schemes
• Using Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages
• The Deterministic Capacity of Relay Networks with Relay Private Messages