Wireless Network Information Flow

2007/10/19 by A. Salman Avestimehr, Avestimehr, A. S., Suhas Diggavi +3 · 2 citations
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.0710.3781

openalex publication_date 2007/10/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Approximate Capacity of Gaussian Interference-Relay Networks with Weak Cross Links
• A Deterministic Approach to Wireless Relay Networks

Related

• Combinatiorial Algorithms for Wireless Information Flow
• A Deterministic Approach to Wireless Relay Networks
• A Combinatorial Study of Linear Deterministic Relay Networks
• Improved Combinatorial Algorithms for Wireless Information Flow
• A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks