The Complexity of Network Coding With Two Unit-Rate Multicast Sessions

DOI10.1109/TIT.2013.2262492MaRDI QIDQ5346384zbMATH OpenFDO

Authors Wentu Song, Kai Cai, Chau Yuen, Rongquan Feng

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2013.2262492

Mathematics Subject Classification ID

Source coding (94A29) Applications of graph theory to circuits and networks (94C15)

Cited in

(6)

• Network encoding complexity: exact values, bounds, and inequalities
• An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding
• scientific article; zbMATH DE number 5455150 (Why is no real title available?)
• Dynamic Algorithms for Multicast With Intra-Session Network Coding
• A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks
• Lower Bounds for Multiplication via Network Coding

This page was built for publication: The Complexity of Network Coding With Two Unit-Rate Multicast Sessions

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