Network Coding for Computing: Cut-Set Bounds

DOI10.1109/TIT.2010.2095070MaRDI QIDQ5281091zbMATH OpenFDO

Authors Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger

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.2010.2095070

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Measures of information, entropy (94A17) Source coding (94A29)

Cited in

(7)

• Cut-Set Bounds on Network Information Flow
• scientific article; zbMATH DE number 5455109 (Why is no real title available?)
• Towards a queueing-based framework for in-network function computation
• On Tackling Explanation Redundancy in Decision Trees
• Lower Bounds for Multiplication via Network Coding
• On the Hardness of Approximating the Network Coding Capacity
• Sheaf cohomology on network codings: maxflow-mincut theorem

This page was built for publication: Network Coding for Computing: Cut-Set Bounds

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