Title :
Network Coding and Matroid Theory
Author :
Dougherty, Randall ; Freiling, Chris ; Zeger, Kenneth
Author_Institution :
Center for Commun. Res., San Diego, CA, USA
fDate :
3/1/2011 12:00:00 AM
Abstract :
Networks derived from matroids have played a fundamental role in proving theoretical results about the limits of network coding. In this tutorial paper, we review many connections between matroids and network coding theory, with specific emphasis on network solvability, admissible network alphabet sizes, linear coding, and network capacity.
Keywords :
graph theory; linear algebra; linear codes; matrix algebra; admissible network alphabet sizes; graph theory; linear algebra; linear coding; matroid theory; network capacity; network coding; network coding theory; network solvability; Encoding; Entropy; Finite element methods; Network coding; Routing; Routing protocols; Upper bound; Vectors; Capacity; flow; information theory; matroid; multicast; network coding; polymatroid;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/JPROC.2010.2095490
