Information flow decomposition for network coding
From MaRDI portal
Publication:3546889
DOI10.1109/TIT.2005.864435zbMath1300.94008OpenAlexW2134859306MaRDI QIDQ3546889
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
convolutional codesmax-flow min-cut theoremnetwork codinginformation flowmaximum distance separable (MDS) codesArcsdecentralized codesnetwork multicast
Combined modulation schemes (including trellis codes) in coding theory (94B12) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)
Related Items (3)
(Secure) linear network coding multicast ⋮ An effective genetic algorithm for network coding ⋮ Multicast triangular semilattice network
This page was built for publication: Information flow decomposition for network coding