Network coding capacity: A functional dependence bound

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 263-267

  Thakor, Satyajit ^a   Grant, Alex ^a   Chan, Terence ^a  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY REGIONS; EXPONENTIAL GROWTH; FUNCTIONAL DEPENDENCE; FUNCTIONAL DEPENDENCY; HARD PROBLEMS; IN-NETWORK; MULTISOURCES; NETWORK CODING; NETWORK SIZE; OPEN PROBLEMS; OUTER BOUNDS;

LINEARIZATION;

INFORMATION THEORY;

EID: 70449482064     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205943     Document Type: Conference Paper

References (18)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, pp. 1204-1216, July 2000.
2. S.-Y. R. Li, R. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, pp. 371-381, Feb. 2003.
3. R. W. Yeung, S.-Y. Li, N. Cai, and Z. Zhang, Network Coding Theory. now Publishers, 2006.
4. C. Fragouli and E. Soljanin, Network Coding Fundamentals. now Publishers, 2007.
5. C. Fragouli and E. Soljanin, Network Coding Applications. now Publishers, 2008.
6. T. Ho and D. S. Lun, Network Coding: An Introduction. Cambridge University Press, 2008.
7. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inform. Theory, vol. 51, Aug. 2005. To appear.
8. T. H. Chan and A. Grant, "Dualities between entropy functions and network codes," IEEE Trans. Inform. Theory, vol. 54, pp. 4470-4487, Oct. 2008.
9. R. W. Yeung, A First Course in Information Theory. Information Technology: Transmission, Processing and Storage, New York: Kluwer cademic/Plenum Publishers, 2002.
10. L. Song, R. W. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inform. Theory, vol. 49, pp. 3129-3139, Dec. 2003.
11. X. Yan, R. W. Yeung, and Z. Zhang, "The capacity region for multisource multi-sink network coding," in IEEE Int. Symp. Inform. Theory, (Nice, France), pp. 116-120, Jun. 2007.
12. F. Matúš, "Infinitely many information inequalities," in IEEE Int. Symp. Inform. Theory, 2007.
13. X. Yan, J. Yang, and Z. Zhang, "An outer bound for multisource multisink network coding with minimum cost consideration," IEEE Trans. Inform. Theory, vol. 52, pp. 2373-2385, June 2006.
14. N. Harvey, R. Kleinberg, and A. Lehman, "On the capacity of information networks," IEEE Trans. Inform. Theory, vol. 52, pp. 2345-2364, June 2006.
15. G. Kramer, Directed Information for Channels with Feedback. PhD thesis, Swiss Federal Institute of Technology, Zurich, 1998.
16. L. Guille, T. Chan, and A. Grant, "The minimal set of Ingleton inequalities," in IEEE Int. Symp. Inform. Theory, pp. 2121-2125, July 2008.
17. I. Grivell, A. Grant, and T. Chan, "Basic entropy sets," in Fourth Workshop on Network Coding, Theory and Applications, pp. 1-6, Jan. 2008.
18. T. Cover, and J. Thomas, Elements of Information Theory. 2nd ed. John Wiley and Sons, Inc., 2006.