Wireless Network Information Flow

Abstract

We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set bound is a product distribution, then we have a complete characterization of the achievable rates for such networks. For linear deterministic finite-field models discussed in a companion paper [3], this is indeed the case, and we have a generalization of the celebrated max-flow min-cut theorem for such a network.

- Corrected Typos

References in corpus (1)

• A Deterministic Approach to Wireless Relay Networks

Cited by in corpus (9)

• Wireless Network Information Flow: A Deterministic Approach
• The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
• A Deterministic Approach to Wireless Relay Networks
• Approximate Capacity of Gaussian Relay Networks
• Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints
• Approximate Capacity of Gaussian Interference-Relay Networks with Weak Cross Links
• The two-user Gaussian interference channel: a deterministic view
• Pipelined Encoding for Deterministic and Noisy Relay Networks
• Shannon Meets Nash on the Interference Channel