Beyond routing via network coding: An overview of fundamental information-theoretic results

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Volumn , Issue , 2010, Pages 2745-2750

  Di Renzo, Marco ^a   Iezzi, Michela ^b   Graziosi, Fabio ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION NETWORKS; ELECTRICAL ENGINEERING AND COMPUTER SCIENCE; FUNDAMENTAL LIMITS; INTERMEDIATE NODE; MULTIPLE LINKS; NETWORK CODING; NETWORK ERROR CORRECTION; NETWORK INFORMATION; NETWORK NODE; PRACTICAL EXPERIMENTATION; REAL NETWORKS; REAL WORLD ENVIRONMENTS; RESEARCH AREAS; STORE AND FORWARD; THEORETICAL STUDY;

COMMUNICATION; DATA HANDLING; INFORMATION THEORY; NETWORKS (CIRCUITS); RESEARCH;

RADIO COMMUNICATION;

EID: 78751548566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PIMRC.2010.5671808     Document Type: Conference Paper

References (29)

1. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting", IEEE Int. Symposium Inform. Theory, pp. 442, June/July 2003.
2. C. Fragouli, E. Soljanin, Network Coding Fundamentals, vol. 2/1, 2007.
3. C. Fragouli, E. Soljanin, Network Coding Applications, vol. 2/2, 2007.
4. 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.
5. S. Zhang, S. Liew, and P. Lam, "Hot topic: Physical layer network coding", ACM Int. Conf. Mobile Computing and Networking, pp. 358-365, May 2006.
6. P. Elias, A. Feinstein, and C. E. Shannon, "Note on maximum flow through a network", IRE Trans. Inform. Theory, vol. 2, no. 4, pp. 117-119, Dec. 1956.
7. L. R. Ford Jr. and D. R. Fulkerson, "Maximal flow through a network", Canadian J. Mathematics, vol. 8, pp. 399-404, 1956.
8. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding", IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
9. R. Koetter and M. Médard, "An algebraic approach to network coding", IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
10. T. Ho, R. Koetter, M. Médard, D. R. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast", IEEE Trans. Inform. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
11. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding", Allerton Conf. Commun. Control, Computing, Oct. 2003.
12. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding", IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
13. Z. Zhang, "Linear network error correction codes in packet networks", IEEE Trans. Inform. Theory, vol. 54, no. 1, pp. 209-218, Jan. 2008.
14. N. Cai and R. W. Yeung, "Network coding and error correction", IEEE Inform. Theory Workshop, pp. 119-122, Oct. 2002.
15. R. W. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds", Commun. Information Systems, vol. 6, no. 1, pp. 19-36, 2006.
16. N. Cai and R. W. Yeung, "Network error correction, part II: Lower bounds", Commun. Information Systems, vol. 6, no. 1, pp. 37-54, 2006.
17. R. Matsumoto, "Construction algorithm for network error-correcting codes attaining the Singleton bound", IEICE Trans. Fundamentals, vol. E90-A, no. 9, pp. 1-7, Sept. 2007.
18. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Médard, and M. Effros, "Resilient network coding in the presence of byzantine adversaries", IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2596- 2603, June 2008.
19. H. Balli, X. Yan, and Z. Zhang, "On randomized linear network codes and their error correction capabilities", IEEE Trans. Inform. Theory, vol. 55, no. 7, pp. 3148-3160, July 2009.
20. T. Etzion and N. Silberstein, "Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams", IEEE Trans. Inform. Theory, vol. 55, no. 7, pp. 2909-2919, July 2009.
21. S.-T. Xia and F.-W. Fu, "Johnson type bounds on constant dimension codes", Designs, Codes, and Cryptography, vol. 50, no. 2, pp. 163-172, June 2008.
22. E. M. Gabidulin and M. Bossert, "Codes for network coding", IEEE Int. Symposium Inform. Theory, pp. 867-870, July 2008.
23. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding", IEEE Trans. Inform. Theory, vol. 54, no. 9, pp. 3951-3967, Sept. 2008.
24. A. Kohnert and S. Kurz, "Construction of large constant dimension codes with a prescribed minimum distance", Lecture Notes in Computer Science, Springer, pp. 31-42, Dec. 2008.
25. R. Ahlswede and H. Aydinian, "On error control codes for random network coding", IEEE Int. Workshop Network Coding Theory and Applications, pp. 68-73, June 2009.
26. M. Gadouleau and Z. Yan, "Bounds on covering codes with the rank metric", arXiv.org, June 2009. [Online]. Available: http://arxiv.org/PS cache/arxiv/pdf/0809/0809.2968v2.pdf.
27. D. Silva and F. R. Kschischang, "On metrics for error correction in network coding", arXiv.org, Aug. 2009. [Online]. Available: http://arxiv.org/PS cache/arxiv/pdf/0805/0805.3824v4.pdf.
28. A. Khaleghi and F. R. Kschischang, "Projective space codes for the injection metric", arXiv.org, Apr. 2009. [Online]. Available: http://arxiv.org/PS cache/arxiv/pdf/0904/0904.0813v2.pdf.
29. N. Chen, M. Gadouleau, and Z. Yan, "Rank metric decoder architectures for noncoherent error control in random network coding", IEEE Workshop Sig. Process. Systems, Oct. 2009.