Low complexity encoding for network codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 40-44

  Jaggi, Sidharth ^a   Suto, Yuval Cas ^b   Effros, Michelle ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY SCALES; MULTICAST CODES; NETWORK CODES; RANDOMIZED ALGEBRAIC NETWORKS;

BLOCK CODES; COMPUTATIONAL COMPLEXITY; IMAGE CODING; MULTICASTING; NETWORK SECURITY; OPTIMAL SYSTEMS;

CHANNEL CODING;

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

References (12)

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. K. Bhattad, N. Ratnakar, R. Koetter, and K. R. Narayanan. Minimal network coding for multicast. In IEEE International Symposium on Information Theory (ISIT), Adelaide, Australia, Sept 4-9 2005.
3. T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, June 29-July 4 2003.
4. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger. On randomized network coding. In Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2003.
5. S. Jaggi, P. A. Chou, and K. Jain. Low complexity algebraic multicast network codes. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), page 368, Yokohama, July 2003.
6. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, 51(6):1973-1982, June 2005.
7. R. Koetter and M. Médard. Beyond routing: An algebraic approach to network coding. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOMM), volume 1, pages 122-130, 2002.
8. M. Langberg, A. Sprintson, and J. Bruck. The encoding complexity of network coding. In IEEE International Symposium on Information Theory (ISIT), pages 1987-1991, Sept 4-9 2005.
9. A. H. Lee and M. Médard. Simplified random network codes for multicast networks. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Adelaide, Australia, Sept 4-9 2005.
10. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Transactions on Information Theory, 49(2):371-381, 2003.
11. R. Lidl and H. Niederreiter. Finite Fields. Cambridge University Press, UK, 1997.
12. P. Pakzad, C. Fragouli, A. Shokrollahi Coding schemes for line networks In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Adelaide, Australia, Sept 4-9 2005.