Wireless Network Information Flow
- arXiv: 0710.3781v2
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 , this is\nindeed the case, and we have a generalization of the celebrated max-flow\nmin-cut theorem for such a network.