Wireless Network Information Flow: A Deterministic Approach

DOI10.1109/TIT.2011.2110110zbMATH1366.94162MaRDI QIDQ5280955FDOQ5280955

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)

Mathematics Subject Classification ID

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

Cited in

(10)

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

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)