Wireless Network Information Flow

by A. S Avestimehr, S. N Diggavi, D. N. C Tse
0710.3781 ()


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.

Cite this document (BETA)

Readership Statistics

1 Reader on Mendeley
by Discipline
by Academic Status
100% Ph.D. Student
by Country
100% Spain

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in