Networks, matroids, and non-Shannon information inequalities

IEEE Transactions on Information Theory

Volumn 53, Issue 6, 2007, Pages 1949-1969

  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

Flow; Information theory; Matroids; Multiple unicast; Network coding

Indexed keywords

CHANNEL CAPACITY; MULTICASTING; SIGNAL ENCODING;

LINEAR CODING CAPACITY; MATROIDAL NETWORKS; NETWORK CODING;

INFORMATION THEORY;

EID: 34249811774     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.896862     Document Type: Article

References (35)

1. M. Adler, N. J. A. Harvey, K. Jain, R. D. Kleinberg, and A. L. Rasala, "On the capacity of information nework," in Proc. ACM-SIAM Symp. Discrete Algorithms (SODA 06), Miami, FL, Jan. 2006.
2. R. Ahlswede, N. Cai, R. Li S.-Y, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
3. J. Cannons, R. Dougherty, C. Freilinig and K. Zeger, "Network routing capacity," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 777-788, Mar. 2006.
4. T. H. Chan and R. W. Yeung, "On a relation between information in-equalities and group theory," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1992-1995, Jul. 2002.
5. 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.
6. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2365-2372, Jun. 2006.
7. 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.
8. S. E. Rouayheb, C. N. Georghiades, and A. Sprintson, Dec. 2005, personal communication.
9. L. R. Ford Jr. and D. R. Fulkers on, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
10. S. Fujishige, "Polymatroidal dependence structure of a set of random variables," Inf. Contr., vol. 39, pp. 55-72, 1978.
11. P. Gács and J. Körner, "Common information is far less than mutual information" Probl. Contr. Inf. Theory, vol. 2, no. 2, pp. 149-162, 1973.
12. D. Hammer, A. E. Romashchenko, A. Shen, and N. K. Vereshchagin, "Inequalities for Shannon entropy and Kolmogorov complexity," J. Comp. Syst. Sci., vol. 60, pp. 442-464, 2000.
13. N. J. A. Harvey, and A. R. Lehman, Dec. 2005, personal communication.
14. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman, "On the capacity of information network," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2345-2364, Jun. 2006.
15. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Network Syst. Manag., vol. 14, no. 1, pp. 49-67, Mar. 2006.
16. A. W. Ingleton, Representation of Matroids in Combinatorial Mathematics and Its Applications, D. J. A. Welsh, Ed. London, U. K.: Academic, 1971, pp. 149-167.
17. A. L. Rasala and E. Lehman, "Network information flow: Does the model need tuning?," in Proc. Symp. Discete Algorithms (SODA , Vancouver, BC, Canada, Jan. 2005, pp. 499-504.
18. R. Li S.-Y, R. W. Yeung, and N. Cai, "Linear network coding" IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
19. R. Lněnička, "On the tighness of the Zhang-Yeung inequality for Gaussian vectors," Commun. Inf. Syst., vol. 3, no. 1, pp. 41-46, Jun. 2003.
20. K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, "A new class of non-Shannon-type inequalities for entropies," Commun. Inf. Syst. vol. 2, no. 2, pp. 147-166, Dec. 2002.
21. F. Matúš, "Extreme convex set functions with many nonnegative differences," Discr. Math., vol. 135, pp. 177-191, 1994.
22. F. Matúš, "Conditional independences among four random variables III: Final conclusion," Comb., Probab., Comput., vol. 8, pp. 269-276, 1999.
23. F. Matúš, "Inequalities for Shannon entropies and adhesivity of polymatroids," in Proc. Canadian Workshop on Information Theory, Montreal, QC, Canada, 2005, pp. 28-31.
24. F. Matúš and M. Studený, "Conditional independence among four random variables I," Comb., Probab., Comput., vol. 4, pp. 269-278, 1995.
25. M. Médard, M, Effros, T. Ho, and D. Karger, "On coding for non-multicast network," in Proc. 41st Annu. Allerton Conf. Communication Control and Computing, Monticello, IL, Oct. 2003.
26. J. G. Oxley, Matroid Theory. New York: Oxford Univ. Press, 1992.
27. I. Satake, Linear Algebra. New York Marcel Dekker, 1975.
28. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423 and 623-656, Oct. 1948.
29. 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.
30. D. J. A. Welsh, Matroid Theory. London, U.K.: Academic, 1976.
31. R. Yeung, R.S.-Y. Li, N. Cai, and Z. Zhang, Foundations and Trends in Communication and Information Theory: Network Coding Theory. Boston, MA: Now Publishers, 2006.
32. R. W. Yeung, A First Course in Information Theory. Norwell, MA: Kluwer, 2002.
33. Z. Zhang, "On a new non-Shannon type, information inequality," Commun. Inf. Syst., vol. 3, no. 1, pp. 47-60, Jun. 2003.
34. Z. Zhang and R. W. Yeung, "A non-Shannon-type conditional inequality of information quantities" IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1982-1985, Nov. 1997.
35. Z. Zhang and R. W. Yeung. "On characterization of entropy function via information inequalities," IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1140-1452, Jul. 1998.