Information flow decomposition for network coding

IEEE Transactions on Information Theory

Volumn 52, Issue 3, 2006, Pages 829-848

  Fragouli, Christina ^a,b   Soljanin, Emina ^a,c  

^a IEEE   (Switzerland)

^b EPFL   (Switzerland)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Arcs; Convolutional codes; Decentralized codes; Information flow; Max flow min cut theorem; Maximum distance separable (MDS) codes; Network coding; Network multicast

Indexed keywords

ARCS; DECENTRALIZED CODES; INFORMATION FLOW; MAX-FLOW MIN-CUT THEOREM; MAXIMUM DISTANCE SEPARABLE (MDS) CODES; NETWORK CODING; NETWORK MULTICAST;

ALGORITHMS; CONVOLUTIONAL CODES; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY; MULTICASTING; TOPOLOGY;

COMPUTER NETWORKS;

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

References (25)

1. 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.
2. 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.
3. R. Koetter and M. Médard, "Beyond routing: An algebraic approach to network coding," in Proc. IEEE INFOCOM 2002, vol. 1, New York, Jun. 2002, pp. 122-130.
4. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th ACM Symp. Parallel Algorithms and Architectures, San Diego, CA, Jun. 2003, pp. 286-294.
5. S. Jaggi, P. Chou, and K. Jain, "Low complexity algebraic multicast network codes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 368.
6. P. A. Chou, M. Effros, S. Egner, S. Jaggi, K. Jain, P. Sanders, and L. Tolhuizen, "Linear multicast network coding algorithms," IEEE Trans. Inf. Theory, submitted for publication.
7. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput benefits and alphabet size for network coding," IEEE Trans. Inf. Theory. Special Issue on Networking and Information Theory (Joint Special Issue of the IEEE Trans. Inf. Theory and the IEEE/ACM Trans. Netw.), submitted for publication.
8. C. Fragouli, E. Soljanin, and A. Shokrollahi, "Network coding as a coloring problem," in Proc. Conf. Information Sciences and Systems. Princeton, NJ, Mar. 2004.
9. C. Fragouli and E. Soljanin, "A connection between network coding and convolutional codes," in Proc. IEEE Int. Conf. Communications, vol. 2, Paris, France, Jun. 2004, pp. 661-666.
10. _, "Decentralized network coding," in Proc. Information Theory Workshop, San Antonio, TX, Oct. 2004.
11. _, "On average throughput benefits for network coding," Proc. Allerton Conf. Communications, Control and Computing, Sep./Oct. 2004.
12. M. Feder, D. Ron, and A. Tavory, "Bounds on linear codes for network multicast," in Electronic Colloquium on Computational Complexity, 2003, Rep. 33.
13. E. Erez and M. Feder, "Convolutional network codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 146.
14. A. Rasala-Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. Symp. Discrete Algorithms (SODA), New Orleans, LA, Jan. 2004, pp. 142-150.
15. R. Diestel, Graph Theory, 2nd ed. Berlin, Germany: Springer-Verlag, 2000.
16. A. H. Ali, J. W. P. Hirschfeld, and H. Kaneta, "On the size of arcs in projective spaces," IEEE Trans. Inf. Theory, vol. 41, no. 5, pp. 1649-1656, Sep. 1995.
17. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. Amsterdam, The Netherlands: North-Holland, 1979.
18. R. Lidl and H. Niederreiter, Finite Fields. New York: Cambridge Univ. Press, 1997.
19. H.-A. Loeliger, G. D. Forney, T. Mittelholzer, and M. D. Trott, "Minimality and observability of group systems," Linear Algebra and Its Applications, vol. 205-206, pp. 937-963, Jul. 1994.
20. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros. "The benefits of coding over routing in a randomized setting," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun/Jul. 2003.
21. T. Ho, D. R. Karger, M. Médard, and R. Koetter, "Network coding from a network flow perspective," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003.
22. T. Ho, M. Mèdard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proc. Allerton Conf. Communications, Control and Computing, Monticello, IL, Sep./Oct. 2004.
23. S. Jukna, Extrernal Combinatorics. Berlin, Germany: Springer-Verlag, 2001.
24. U. Manber, Introduction to Algorithms: A Creative Approach. Reading, MA: Adison-Wesley, 1989.
25. Y. Sagduyu and A. Ephremides, "Crosslayer design for distributed MAC and network coding in wireless ad hoc networks," in Proc. IEEE Int. Symp. Information Theory, Adelaide, S.A., Australia, Sep. 2005, pp. 1863-1867.