Dualities between entropy functions and network codes

IEEE Transactions on Information Theory

Volumn 54, Issue 10, 2008, Pages 4470-4487

  Chan, Terence ^a   Grant, Alex ^a  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

Channel coding; Duality; Encoding; Entropy; Entropy functions; Indexes; Ingleton's inequality; LP bounds; Network codes; Polymatroids; Pseudovariables; Random variables; Receivers; Vectors

Indexed keywords

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

References (36)

1. T. H. Chan and A. Grant, "Entropy vectors and network codes," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, 2007.
2. T. H. Chan and A. Grant, "Dualities between entropy functions and network codes," in Proc. Fourth Workshop on Network Coding, Theory, Appl., Hong Kong, Jan. 2008.
3. R. Yeung, A First Course in Information Theory. New York: Kluwer Academic/Plenum, 2002.
4. Z. Zhang and R. W. Yeung, "On the characterization of entropy function via information inequalities," IEEE Trans. Inf. Theory, vol. 44, pp. 1440-1452, 1998.
5. Z. Zhang and R. W. Yeung, "A non-Shannontype conditional information inequality of information quantities," IEEE Trans. Inf. Theory, vol. 43, pp. 1982-1986, Nov. 1997.
6. R. W. Yeung and Z. Zhang, "A class of non-Shannon-type information inequalities and their applications," Commun. Inf. Syst., vol. 1, pp. 87-100, 2001.
7. R. W. Yeung and Z. Zhang, "A class of non-Shannontype information inequalities and their applications," in IEEE Int. Symp. Inform. Theory, Washington, DC, 2001, pp. 231-231.
8. I. Sason, "Identification of new classes of non-Shannon type constrained information inequalities and their relation to finite groups," in Proc. IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, 2002, pp. 236-236.
9. F. Matúš, "Piecewise linear conditional information inequality," IEEE Trans. Inf. Theory, vol. 52, pp. 236-238, Jan. 2006.
10. K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, "A new class of non-Shannontype inequalities for entropies," Commun.n Inf. Syst., vol. 2, no. 2, pp. 147-165, Dec. 2002.
11. R. Dougherty, C. Freiling, and K. Zeger, "Six new non-Shannon information inequalities," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2006, pp. 233-236.
12. F. Matúš, "Infinitely many information inequalities," in Proc. IEEE Int. Symp. Inf. Theory, 2007.
13. R. W. Yeung and Z. Zhang, "Distributed source coding for satellite communications," IEEE Trans. Inf. Theory, vol. 45, pp. 1111-1120, May 1999.
14. T. H. Chan and R. W. Yeung, "On a relation between information inequalities and group theory," IEEE Trans. Inf. Theory, vol. 48, pp. 1992-1995, 2002.
15. 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.
16. A. Romashchenko, N. Vereshchagin, and A. Shen, "Combinatorial interpretation of Kolmogorov complexity," in Proc. 15th Annu. IEEE Conf. Comput. Compl., Florence, Italy, Jul. 2000, pp. 131-137.
17. R. Ahlswede, N. Cai, R. Li S.-Y, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, Jul. 2000.
18. R. Li S.-Y, R. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, pp. 371-381, Feb. 2003.
19. A. F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, "Capacity of wireless erasure networks," IEEE Trans. Inf. Theory vol. 52, pp. 789-804, Mar. 2006.
20. N. Cai and R. W. Yeung, "Secure network coding," in Proc. IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, 2002, pp. 323-323.
21. T. H. Chan and A. Grant, "Mission impossible: Computing the network coding capacity region," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 2008.
22. T. Chan and A. Grant, "Capacity bounds for secure network coding," in Australian Commun. Theory Workshop, Christchurch, NZ, 2008.
23. D. S. Lun, N. Ratanakar, M. Médard, R. Koetter, D. R. Karger, T. Ho, and E. Ahmed, "Minimum-cost multicast over coded packet networks," IEEE Trans. Inf. Theory, vol. 52, pp. 2608-2623, Jun. 2006.
24. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, pp. 2745-2759, Aug. 2005.
25. L. Song, R. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inf. Theory, vol. 49, pp. 3129-3139, Dec. 2003.
26. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory ser. Foundations and Trends in Communications and Information Theory. New York: Now Publishers, 2006.
27. X. Yan, R. W. Yeung, and Z. Zhang, "The capacity region for multi-source multi-sink network coding," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 2007, pp. 116-120.
28. R. Dougherty, C. Freiling, and K. Zeger, "Matroids, networks, and non-Shannon information inequalities," IEEE Trans. Inf. Theory, 2007.
29. T. H. Chan, "A combinatorial approach to information inequalities," Commun. Inf. Syst., vol. 1, pp. 1- 14, 2001.
30. T. H. Chan, "Aspects of Information Inequalities and Its Applications," Master's thesis, The Chinese University of Hong Kong, 1998.
31. T. H. Chan, "Group characterizable entropy functions," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, 2007.
32. L. Guille, T. Chan, and A. Grant, "The minimal set of Ingleton's in-equalities," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, 2008.
33. T. H. Chan, "Capacity regions for linear and abelian network code," in NETCOD, San Diego, CA, 2007.
34. T. H. Chan, "Capacity region of probabilistic network codes," in Canadian Workshop Inf. Theory, Montreal, PQ, Canada, Jun. 2005, pp. 167-170.
35. R. Yeung, "A framework for linear information inequalities," IEEE Trans. Inf. Theory, vol. 43, pp. 1924-1934, Nov. 1997.
36. F. Matúš, "Adhesivity of polymatroids," Discr. Math., 2007.