Linearity and Solvability in Multicast Networks

DOI10.1109/TIT.2004.834751MaRDI QIDQ3546815zbMATH OpenFDO

Authors Randall Dougherty, Chris Freiling, Kenneth Zeger

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Communication theory (94A05) Information theory (general) (94A15) Source coding (94A29)

Recommendations

• Insufficiency of Linear Coding in Network Information Flow
• Linear network coding
• Representations of the multicast network problem
• (Secure) linear network coding multicast
• A Random Linear Network Coding Approach to Multicast

Cited in

(6)

• Insufficiency of Linear Coding in Network Information Flow
• Binary linear programming models for robust broadcasting in communication networks
• Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
• Multicasting in Linear Deterministic Relay Network by Matrix Completion
• A characterization of solvability for a class of networks
• Max-flow min-cut theorems on dispersion and entropy measures for communication networks

This page was built for publication: Linearity and Solvability in Multicast Networks

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