Wireless Network Information Flow

Simple item page
dc.creatorAvestimehr, A. S.
dc.creatorDiggavi, S. N.
dc.creatorTse, D. N. C.
dc.date2007-10-19
dc.date2007-10-24
dc.date.accessioned2026-07-07T08:38:01Z
dc.date.available2026-07-07T08:38:01Z
dc.descriptionWe 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.
dc.description- Corrected Typos
dc.identifierhttps://arxiv.org/abs/0710.3781
dc.identifierhttp://arxiv.org/abs/0710.3781
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140576
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectProbability
dc.titleWireless Network Information Flow
dc.typetext

Files

Collections

arXiv