On the relation between the index coding and the network coding problems

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1823-1827

  Rouayheb, Salim El ^a   Sprintson, Alex ^a   Georghiades, Costas ^a  

^a Texas A and M University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING PROBLEMS; INFORMATION MESSAGES; INTERNATIONAL SYMPOSIUM; NETWORK CODING;

CYBERNETICS; IMAGE CODING; INFORMATION THEORY; TECHNICAL PRESENTATIONS;

PROGRAMMING THEORY;

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

References (15)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network Information Flow. IEEE Transactions on Information Theory, 46(4):1204-1216, 2000.
2. C. Fragouli and E. Soljanin. Network Coding Fundamentals (Foundations and Trends in Networking). Now Publishers Inc, 2007,
3. R. Yeung, S-Y. Li, and N. Cai. Network Coding Theory (Foundations and Trends in Communications and Information Theory). Now Publishers Inc, 2006.
4. Z. Bar-Yossef, Y. Birk. T. S. Jayram. and T. Kol. Index coding with side information. In Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
5. Y. Wu, J. Padhye, R. Chandra, V. Padmanabhan, and P. A. Chou. The local mixing problem. In Proc. Information Theory and Applications Workshop. San Diego, Feb. 2006.
6. S. El Rouayheb, M.A.R. Chaudhry, and A. Sprintson. On the minimum number of transmissions in single-hop wireless coding networks. In IEEE Information Theory Workshop (Lake Tahoe), 2007.
7. E. Lubetzky and U. Stav. Non-linear index coding outperforming the linear optimum. In Proc. of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 161-167, 2007.
8. M. A. R. Chaudhry and A. Sprintson. Efficient algorithms for index coding. 2008.
9. R. Dougherty, C. Freiling, and K. Zeger. Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory. 51(8):2745-2759, 2005.
10. D.J.A. Welsh. Matroid Theory. Academic Press, London. London, 1976.
11. M. Effros, M. Medard, T. Ho, and D. Karger. On coding for nonmulticast networks. In Proceedings of the IEEE International Symposium on Information Theory. 2003.
12. R. Dougherty, C. Freiling, and K. Zeger. Networks, matroids, and nonshannon information inequalities. IEEE Transactions on Information Theory, 53(6), June 2007.
13. J. G. Oxley. Matroid Theory. Oxford University Press, USA, New York, NY, USA. January 1993.
14. J. Simonis and A. Ashikhmin. Almost affine codes. Desings, Codes and Cryptography, 14:179-797, 1998.
15. F. Matús. Matroid representations by partitions. Discrete Mathematics, 203:169-194, 1999.