Network Coding for Computing: Cut-Set Bounds
From MaRDI portal
Publication:5281091
DOI10.1109/TIT.2010.2095070zbMATH Open1366.90030MaRDI QIDQ5281091FDOQ5281091
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)
Deterministic network models in operations research (90B10) Measures of information, entropy (94A17) Source coding (94A29) Communication networks in operations research (90B18)
Cited In (7)
- On Tackling Explanation Redundancy in Decision Trees
- On the Hardness of Approximating the Network Coding Capacity
- Cut-Set Bounds on Network Information Flow
- Towards a queueing-based framework for in-network function computation
- Sheaf cohomology on network codings: maxflow-mincut theorem
- Lower Bounds for Multiplication via Network Coding
- Title not available (Why is that?)
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)
