Related references
Note: Only part of the references are listed.On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
Salim El Rouayheb et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2010)
Linear network codes and systems of polynomial equations
Randall Dougherty et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2008)
Dualities between entropy functions and network codes
Terence Chan et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2008)
Reversible and irreversible information networks
Soren Riis
IEEE TRANSACTIONS ON INFORMATION THEORY (2007)
Networks, matroids, and-non-Shannon information inequalities
Randall Dougherty et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2007)
Nonreversibility and equivalent constructions of multiple-unicast networks
Randall Dougherty et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
On the capacity of information networks
Nicholas J. A. Harvey et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
Unachievability of network coding capacity
Randall Dougherty et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
Edge-cut bounds on network coding rates
Gerhard Kramer et al.
JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT (2006)
Network routing capacity
J Cannons et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
Insufficiency of linear coding in network information flow
R Dougherty et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
An algebraic approach to network coding
R Koetter et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2003)
Linear network coding
SYR Li et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2003)
Zero-effor network coding for acyclic networks
LH Song et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2003)
Network information flow
R Ahlswede et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2000)
Inequalities for Shannon entropy and Kolmogorov complexity
D Hammer et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2000)
Share Paper
