Information flow decomposition for network coding

DOI10.1109/TIT.2005.864435MaRDI QIDQ3546889zbMATH OpenOpenAlexFDO

Authors Christina Fragouli, Emina Soljanin

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.2005.864435

zbMATH Keywords

convolutional codesmax-flow min-cut theoremnetwork codinginformation flowmaximum distance separable (MDS) codesArcsdecentralized codesnetwork multicast

Mathematics Subject Classification ID

Communication theory (94A05) Applications of graph theory to circuits and networks (94C15) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Network information flow
• Linear network coding
• Complexity classification of network information flow problems
• A Random Linear Network Coding Approach to Multicast
• Deterministic network coding by matrix completion

Cited in

(6)

• An effective genetic algorithm for network coding
• An information-theoretic framework for the lossy compression of link streams
• Multicast triangular semilattice network
• A separation theorem for single-source network coding
• Multiple-Access Network Information-Flow and Correction Codes
• (Secure) linear network coding multicast

This page was built for publication: Information flow decomposition for network coding

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