Network coding and matroid theory

Proceedings of the IEEE

Volumn 99, Issue 3, 2011, Pages 388-405

  Dougherty, Randall ^a   Freiling, Chris ^b   Zeger, Kenneth ^c  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Capacity; flow; information theory; matroid; multicast; network coding; polymatroid

Indexed keywords

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING; INFORMATION THEORY; MATRIX ALGEBRA; MULTICASTING; PROGRAMMING THEORY;

ALPHABET SIZE; CAPACITY; FLOW; LINEAR CODING; MATROID THEORY; NETWORK CAPACITY; POLYMATROIDS;

NETWORK CODING;

EID: 79951958354     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2010.2095490     Document Type: Article

References (42)

1. M. Adler, N. J. A. Harvey, K. Jain, R. D. Kleinberg, and A. Rasala Lehman, "On the capacity of information networks," in Proc. ACM-SIAM Symp. Discrete Algorithms, Miami, FL, Jan. 2006, DOI: 10.1145/1109557. 1109585.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
3. D. Albert, R. Baldinger, and J. Rhodes, "Undecidability of the identity problem for finite semigroups," J. Symb. Logic, vol. 57, no. 1, pp. 179-192, Mar. 1992.
4. T. Becker, V. Weispfenning, and H. Kredel, Gröobner Bases: A Computational Approach to Commutative Algebra. New York: Springer-Verlag, 1993.
5. L. M. Blumenthal, A Modern View of Geometry. New York: Dover, 1961.
6. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 777-788, Mar. 2006. (Pubitemid 46444873)
7. T. H. Chan and A. Grant, "Dualities between entropy functions and network codes," IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4470-4487, Oct. 2008.
8. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005. (Pubitemid 41158597)
9. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity," IEEE Trans. Inf. Theory/IEEE/ACM Trans. Netw., vol. 52, no. 6, pp. 2365-2372, Jun. 2006. (Pubitemid 43898897)
10. R. Dougherty, C. Freiling, and K. Zeger, "Six new non-Shannon information inequalities," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 2006, pp. 233-236. (Pubitemid 351244088)
11. R. Dougherty, C. Freiling, and K. Zeger, "Networks, matroids, and non-Shannon information inequalities," IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 1949-1969, Jun. 2007. (Pubitemid 46852015)
12. R. Dougherty, C. Freiling, and K. Zeger, "Linear network codes and systems of polynomial equations," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2303-2316, May 2008. (Pubitemid 351689561)
13. R. Dougherty, C. Freiling, and K. Zeger, "Some achievable rate regions with network coding," in preparation.
14. R. Dougherty, C. Freiling, and K. Zeger, "Non-Shannon information inequalities in four random variables," in preparation.
15. R. Dougherty and K. Zeger, "Nonreversibility and equivalent constructions of multiple-unicast networks," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 5067-5077, Nov. 2006. (Pubitemid 44680592)
16. S. El Rouayheb, A. Sprintson, and C. Georghiades, "On the index coding problem and its relation to network coding and matroid theory," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.
17. L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
18. C. Fragouli and E. Soljanin, Network Coding Fundamentals. Boston, MA: Now, 2007.
19. D. Hammer, A. E. Romashchenko, A. Shen, and N. K. Vereshchagin, "Inequalities for Shannon entropy and Kolmogorov complexity," J. Comput. Syst. Sci., vol. 60, pp. 442-464, 2000. (Pubitemid 30586909)
20. N. J. A. Harvey, R. D. Kleinberg, and A. Rasala Lehman, "On the capacity of information networks," IEEE Trans. Inf. Theory/IEEE/ACM Trans. Netw., vol. 52, no. 6, pp. 2345-2364, Jun. 2006. (Pubitemid 43898896)
21. A. W. Ingleton, "Representation of matroids in combinatorial mathematics and its applications," in Combinatorial Mathematics and Its Applications, D. J. A. Welsh, Ed. London, U.K.: Academic, 1971, pp. 149-167.
22. S. Jaggi, M. Effros, T. Ho, and M. Ḿedard, "On linear network coding," in Proc. 42nd Annu. Allerton Conf. Commun. Control Comput., Monticello, Illinois, pp. 40-49, Oct. 2004.
23. R. Koetter, "A duality principle in network coding," presented at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) Workshop on Algebraic Coding Theory and Information Theory, Piscataway, NJ, Dec. 2003.
24. R. Koetter, M. Effros, T. Ho, and M. Ḿedard, "Network codes as codes on graphs," presented at the 38th Annu. Conf. Inf. Sci. Syst., Princeton, NJ, Mar. 2004.
25. R. Koetter and M. Ḿedard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
26. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Netw. Syst. Manage., vol. 14, no. 1, pp. 49-67, Mar. 2006.
27. A. Rasala Lehman and E. Lehman, "Network information flow: Does the model need tuning?" in Proc. Symp. Discrete Algorithms, Vancouver, "C, Canada, Jan. 2005, pp. 499-504. (Pubitemid 40851406)
28. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
29. S. MacLane, "Some interpretations of abstract linear dependence in terms of projective geometry," Amer. J. Math., vol. 58, no. 1, pp. 236-240, Jan. 1936.
30. F. Matús, "Infinitely many information inequalities," in Proc. Int. Symp. Inf. Theory, Nice, France, 2007, pp. 41-44.
31. M. Ḿedard, M. Effros, T. Ho, and D. Karger, "On coding for non-multicast networks," in Proc. 41st Annu. Allerton Conf. Commun. Control Comput., Monticello, IL, pp. 21-29, Oct. 2003.
32. J. G. Oxley, Matroid Theory. New York: Oxford Univ. Press, 1992.
33. S. Riis, "Reversible and irreversible information networks," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4339-4349, Nov. 2007. (Pubitemid 350141930)
34. C. E. Shannon. (1948, Jul./Oct.). A mathematical theory of communication. Bell Syst. Tech. J. [Online]. 27, pp. 379-423. Available: http://cm.bell-labs. com/cm/ms/what/shannonday/paper.html
35. L. Song, R. W. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3129-3139, Dec. 2003.
36. D. J. A. Welsh, Matroid Theory. London, U.K.: Academic, 1976.
37. N. L. White, Ed., Combinatorial Geometries. Cambridge, U.K.: Cambridge Univ. Press, 1987.
38. H. Whitney, "On the abstract properties of linear dependence," Amer. J. Math., vol. 57, pp. 509-533, 1935.
39. W. Xu, J. Wang, and J. Sun, "A projection method for derivation of non-Shannon-type information inequalities," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 2008, pp. 2116-2120.
40. R. W. Yeung, A First Course in Information Theory. Norwell, MA: Kluwer, 2002.
41. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory. Boston, MA: Now, 2006.
42. Z. Zhang and R. W. Yeung, "On characterization of entropy function via information inequalities," IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1440-1452, Jul. 1998. (Pubitemid 128736707)