Wireless Network Information Flow: A Deterministic Approach

From MaRDI portal

Revision as of 20:59, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5280955

Jump to:navigation, search

DOI10.1109/TIT.2011.2110110zbMath1366.94162MaRDI QIDQ5280955

Amir 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

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

Related Items (8)

Network coding for line networks with broadcast channels ⋮ Strong converse theorems for multimessage networks with tight cut-set bound ⋮ A note on polylinking flow networks ⋮ (Secure) linear network coding multicast ⋮ A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project ⋮ Optimum number of hops in linear multihop wireless networks ⋮ Bounded-contention coding for the additive network model ⋮ Multicommodity flows and cuts in polymatroidal networks

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5280955&oldid=19931343"