Skip to content

Wireless Network Information Flow

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

Abstract

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

Cite this document (BETA)

Readership Statistics

1 Reader on Mendeley
by Discipline
 
100% Computer Science
by Academic Status
 
100% Student > Ph. D. Student

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