Efficient network code design for cyclic networks

IEEE Transactions on Information Theory

Volumn 56, Issue 8, 2010, Pages 3862-3878

  Erez, Elona ^a   Feder, Meir ^b  

^a Yale University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Convolutional codes; cyclic networks; multicast; network coding; sequential decoding

Indexed keywords

ACYCLIC NETWORKS; CONVOLUTIONAL NETWORKS; MULTICAST; MULTICAST NETWORK; MULTICAST RATE; NETWORK CODES; NEW CONSTRUCTION; POLYNOMIAL-TIME; SEQUENTIAL DECODING;

BLOCK CODES; CONVOLUTION; CONVOLUTIONAL CODES; DECODING; ENCODING (SYMBOLS); INFORMATION THEORY; MULTICASTING; POLYNOMIALS; TIME MEASUREMENT;

OPTIMAL SYSTEMS;

EID: 77954614159     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2050934     Document Type: Article

References (26)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol.46, no.4, pp. 1204-1216, Jul. 2000.
2. M. Feder, D. Ron, and A. Tavory, "Bounds on linear codes for network multicast," Electron. Colloq. Computat. Complex. (ECCC), vol.10, no.33, 2003.
3. A. Rasala-Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms, New Orleans, LA, Jan. 2004, pp. 142-150.
4. C. Fragouli, E. Soljanin, and A. Shokrollahi, "Network coding as a coloring problem," in Proc. 2004 Conf. Inf. Sci. Syst., Princeton, NJ, Mar. 2004.
5. 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 Trans. Inf. Theory, vol.51, pp. 1973-1982, Jun. 2005.
6. S. Jaggi, M. Effros, T. Ho, and M. Médard, "On linear network coding," in Proc. 42nd Allerton Conf. Commun., Contr. Comput., Monticello, IL, Sep. 2004.
7. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol.49, pp. 371-381, Feb. 2003.
8. R.Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol.11, pp. 782-795, Oct. 2003.
9. C. Fragouli and E. Soljanin, "A connection between network coding and convolutional codes," in Proc. Int. Conf. Commun. (ICC), Paris, France, Jun. 2004, vol.2, pp. 661-666.
10. H. F. Lu, "Binary linear network codes," in Proc. 2007 IEEE Inf. Theory Workshop in Inf. Theory for Wireless Netw., 2007.
11. R. W. Yeung, R. Li S.-Y, N. Cai, and Z. Zhang, "Network coding theory," Found. Trends Commun. Inf. Theory, vol.2, no.4 and 5, pp. 241-381, 2005.
12. S.-Y. R. Li and R. W. Yeung, "On convolutional network coding," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 2006, pp. 1743-1747.
13. T. Ho, R. K. M. Médard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol.52, pp. 4413-4430, Oct. 2006.
14. T. C. Ho, Y.-H. Chang, and K. J. Han, "On constructive network coding for multiple unicasts," in Proc. 44th Allerton Conf. Commun., Contr. Comupt., Monticello, IL, Sep. 2006.
15. N. Harvey, "Deterministic Network Coding by Matrix Completion," Master's, MIT, Cambridge, MA, 2005.
16. E. Erez and M. Feder, "Convolutional network codes," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jun. 2004, pp. 146-146
17. E. Erez and M. Feder, "Convolutional network codes for cyclic networks," in Proc. First Workshop on Network Coding, Theory, Appl., Riva del Garda, Italy, Apr. 2005.
18. E. Erez and M. Feder, "Efficient network codes for cyclic networks," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 1982-1986.
19. E. Erez, "Topics in network coding," Ph.D., Tel Aviv Univ., Tel Aviv, 2007.
20. L. Song, R. Yeung, and N. Cai, "A separation theorem for single-source network coding," IEEE Trans. Inf. Theory, vol.52, pp. 1861-1871, May 2006.
21. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and T. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85-109.
22. G. Even, J. Naor, B. Schieber, and M. Sudan, "Approximating minimum feedback sets and multicuts in directed graphs," Algorithmica, vol.20, no.2, pp. 151-174, 1998.
23. C. P. Jeannerod and G. Villard, "Essentially optimal computation of the inverse of generic polynomial matrices," J. Complex., vol.21, no.1, pp. 72-86, Feb. 2005.
24. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
25. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th Ann. ACM Symp. Parallel Algorithms Architect., San Diego, CA, Jun. 2003, pp. 286-294.
26. S. Roman, Advanced Linear Algebra, 3rd ed. New York: Springer, 2008.