Journal
PROCEEDINGS OF THE IEEE
Volume 99, Issue 3, Pages 388-405Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JPROC.2010.2095490
Keywords
Capacity; flow; information theory; matroid; multicast; network coding; polymatroid
Categories
Funding
- Institute for Defense Analyses
- National Science Foundation
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1018777] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
