Network coding: A computational perspective

IEEE Transactions on Information Theory

Volumn 55, Issue 1, 2009, Pages 147-157

  Langberg, Michael ^a   Sprintson, Alexander ^b   Bruck, Jehoshua ^c  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b Texas AandM University   (United States)

^c California Institute of Technology   (United States)

Author keywords

Algorithms; Computational perspective; Encoding complexity; Fractional network coding; Integer network coding; Multicast connections

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; ENCODING (SYMBOLS); METROPOLITAN AREA NETWORKS; MULTICASTING; POLYNOMIAL APPROXIMATION; PROGRAMMING THEORY;

COMPUTATIONAL PERSPECTIVE; ENCODING COMPLEXITY; FRACTIONAL NETWORK CODING; INTEGER NETWORK CODING; MULTICAST CONNECTIONS;

COMPUTER NETWORKS;

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

References (13)

1. 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, no. 6, pp. 1973-1982, Jun. 2005.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
3. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
4. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
5. T. Ho, R. Koetter,M. Médard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2003.
6. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," IEEE Trans.Inf. Theory, vol. 52, no. 6, pp. 2386-2397, Jun. 2006.
7. N. J. A. Harvey, D. R. Karger, and K. Murota, "Deterministic network coding by matrix completion," in Proc. ACM-SIAM Symp. Discrete Algorithms, Vancouver, BC, Canada, Jan. 2005, pp. 489-498.
8. K. Bhattad, N. Ratnakar, R. Koetter, and K. R. Narayanan, "Minimal network coding for multicast," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1730-1734.
9. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks Flows. Upper Saddle River, NJ: Prentice-Hall, 1993.
10. J. Suurballe and R. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
11. M. Mahdian and M. R. Salavatipour, "Hardness and approximation results for packing Steiner treesproblems," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2004, vol. 3221, pp. 181-191.
12. S. Fortune, J. Hopcroft, and J. Wyllie, "The directed subgraph home-omorphism problem," Theor. Comp. Sci., vol. 10, no. 2, pp. 111-121, 1980.
13. 1.5n)L) arithmetic operations," Math. Program., vol. 47, no. 2, pp. 175-201, Jun. 1990.