Wireless Network Information Flow: A Deterministic Approach

DOI10.1109/TIT.2011.2110110zbMATH Open1366.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 (11)

• Optimum number of hops in linear multihop wireless networks
• Network coding for line networks with broadcast channels
• Combinatiorial algorithms for wireless information flow
• Title not available (Why is that?)
• Multicommodity flows and cuts in polymatroidal networks
• Bounded-contention coding for the additive network model
• 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
• (Secure) linear network coding multicast
• Achieving nonzero information velocity in wireless networks

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)