Unachievability of network coding capacity

MaRDI QIDQ3546817zbMATH OpenFDO

Authors Randall Dougherty, Chris Freiling, Kenneth Zeger

Publication date 21 December 2008

Mathematics Subject Classification ID

Communication theory (94A05) Coding theorems (Shannon theory) (94A24)

Recommendations

• Network routing capacity
• Insufficiency of Linear Coding in Network Information Flow
• Network Coding Capacity With a Constrained Number of Coding Nodes
• Network coding, does the model need tuning?
• Complexity classification of network information flow problems

Cited in

(8)

• Max-flow min-cut theorems on dispersion and entropy measures for communication networks
• Network routing capacity
• Insufficiency of Linear Coding in Network Information Flow
• Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
• Network Coding Capacity With a Constrained Number of Coding Nodes
• A construction method of matroidal networks
• A characterization of solvability for a class of networks
• Capacity factors in a point-to-point network

This page was built for publication: Unachievability of network coding capacity

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