Mission impossible: Computing the network coding capacity region

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 320-324

  Chan, Terence ^a   Grant, Alex ^a  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABILITY; CAPACITY REGIONS; ENTROPY FUNCTIONS; INTERNATIONAL SYMPOSIUM; LINEAR CODING; MULTI-SOURCE; NETWORK CODING; SINGLE SOURCING;

CODES (STANDARDS); CYBERNETICS; INFORMATION THEORY; PROGRAMMING THEORY; TECHNICAL PRESENTATIONS;

CODES (SYMBOLS);

EID: 52349103513     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595000     Document Type: Conference Paper

References (14)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
2. S.-Y. R. Li, R. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
3. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inform. Theory, vol. 51, no. 8. pp. 2745-2759, Aug. 2005.
4. X. Yan, R. Yeung, and Z. Zhang, "The capacity region for multi-source multi-sink network coding," in IEEE Int. Symp. Inform. Theory, Nice. France, 2007, pp. 116-120.
5. L. Song, R. W. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inform. Theory, vol. 49, no. 12, pp. 3129-3139, Dec. 2003.
6. R. W. Yeung, A First Course in Information Theory, ser. Information Technology: Transmission, Processing and Storage. New York: Kluwer Academic/Plenum Publishers, 2002.
7. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory, ser. Foundations and Trends in Communications and Information Theory. Now Publishers, 2006.
8. T. Chan and A. Grant, "Dualities between entropy functions and network codes," accepted for publication in IEEE Trans. Inform. Theory. [Online]. Available: http://arxiv.org/abs/0708.4328vl
9. F. Matus, "Infinitely many information inequalities," in IEEE Int. Symp. Inform. Theory, Nice, France, 2007, pp. 24-29.
10. T. H. Chan and A. Grant, "Capacity bounds for secure network coding," 2008, submitted to Australian Communications Theory Workshop.
11. N. Cai and R. Yeung, "Secure network coding," in IEEE Int. Symp. Inform. Theory, 2002.
12. N. Cai and R. W. Yeung, "A security condition for multi-source linear network coding," in IEEE Int. Symp. Inform. Theory, 2007.
13. J. Feldman, T. Malkin, C. Stein, and R. Servedio, "On the capacity of secure network coding," in 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004.
14. K. Bhattad and K. Narayanan, "Weakly secure network coding," in Workshop on Network Coding, Theory, and Applications, 2005.