The Deterministic Multicast Capacity of 4-Node Relay Networks

2013/04/16 by Ahmed A. Zewail, Zewail, Ahmed A., M. Nafie +5
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1304.4464

5 pages, 2 figures, accepted at ISIT'13

arxiv created 2013/04/16 · arxiv updated 2013/04/17

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.

Related

• The Deterministic Capacity of Relay Networks with Relay Private Messages
• Capacity of a Class of Multicast Tree Networks
• A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks
• A Deterministic Approach to Wireless Relay Networks
• Fast Algorithm for Finding Unicast Capacity of Linear Deterministic Wireless Relay Networks