Network Coding Capacity With a Constrained Number of Coding Nodes

DOI10.1109/TIT.2007.915719zbMATH Open1311.94022OpenAlexW2096414292MaRDI QIDQ3604413FDOQ3604413

Authors: Jillian Cannons, Kenneth Zeger 

Publication date: 24 February 2009

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

Full work available at URL: https://doi.org/10.1109/tit.2007.915719

Recommendations

• Network routing capacity
• The encoding complexity of network coding
• Unachievability of network coding capacity
• Network coding for line networks with broadcast channels
• Linear network coding

Mathematics Subject Classification ID

Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)

Cited In (11)

• Unachievability of network coding capacity
• Network coding for line networks with broadcast channels
• Network routing capacity
• The encoding complexity of network coding
• On the Hardness of Approximating the Network Coding Capacity
• Learning distance metric for object contour tracking
• Object tracking based on an online learning network with total error rate minimization
• A variational method for contour tracking via covariance matching
• Network coding, does the model need tuning?
• Capacity factors in a point-to-point network
• Lower Bounds for Multiplication via Network Coding

This page was built for publication: Network Coding Capacity With a Constrained Number of Coding Nodes

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