Network Coding and Matroid Theory

作     者：Dougherty, Randall Freiling, Chris Zeger, Kenneth 

作者机构：Ctr Commun Res San Diego CA 92121 USA Calif State Univ San Bernardino Dept Math San Bernardino CA 92407 USA Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA 

出 版 物：《PROCEEDINGS OF THE IEEE》 (电气与电子工程师学会会报)

年 卷 期：2011年第99卷第3期

页      面：388-405页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 

基　　金：Institute for Defense Analyses National Science Foundation Direct For Computer & Info Scie & Enginr Division of Computing and Communication Foundations Funding Source: National Science Foundation 

主　　题：Capacity flow information theory matroid multicast network coding polymatroid 

摘      要：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.