Wireless Network Information Flow: A Deterministic Approach

DOI10.1109/TIT.2011.2110110MaRDI QIDQ5280955zbMATH OpenFDO

Authors A. Salman Avestimehr, David N. C. Tse, Suhas N. Diggavi

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2011.2110110

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Information theory (general) (94A15)

Cited in

(10)

• A note on polylinking flow networks
• A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
• Strong converse theorems for multimessage networks with tight cut-set bound
• Combinatiorial algorithms for wireless information flow
• Network coding for line networks with broadcast channels
• scientific article; zbMATH DE number 7051224 (Why is no real title available?)
• Achieving nonzero information velocity in wireless networks
• Optimum number of hops in linear multihop wireless networks
• Bounded-contention coding for the additive network model
• (Secure) linear network coding multicast

This page was built for publication: Wireless Network Information Flow: A Deterministic Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280955)