Linearity and solvability in multicast networks

IEEE Transactions on Information Theory

Volumn 50, Issue 10, 2004, Pages 2243-2256

  Dougherty, Randall ^a   Freiling, Christopher ^b   Zeger, Kenneth ^c  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DATA COMMUNICATION SYSTEMS; DECODING; ENCODING (SYMBOLS); MULTICASTING; ROUTERS; THEOREM PROVING;

MULTICAT NETWORKS; NETWORK INFORMATION THEORY; ROUTING;

INFORMATION THEORY;

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

References (19)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, pp. 1204-1216, July 2000.
2. R. C. Bose and S. S. Shrikhande, "On the falsity of Euler's conjecture about the nonexistence of two orthogonal latin squares of order 4t + 2," Proc. Nat. Acad. Sci., vol. 45, pp. 734-737, 1959.
3. R. C. Bose, and S. S. Shrikhande, "On the construction of sets of mutually orthogonal latin squares and falsity of a conjecture of Euler," Trans. Amer. Math. Soc., vol. 95, pp. 191-209, 1960.
4. R. C. Bose, S. S. Shrikhande, and E. T. Parker, "Further results on the construction of mutually orthogonal latin squares and the falsity of Euler's conjecture," Canad. J. Math., vol. 12, pp. 189-203, 1960.
5. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. IEEE Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
6. M. Feder, D. Ron, and A. Tavory, "Bounds on linear codes for network multicast," in Electronic Colloquium on Computational Complexity (ECCC), 2003, Rep. 33, pp. 1-9.
7. 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, Yokohama, Japan, June 2003, p. 442.
8. T. Ho, D. Karger, M. Médard, and R. Koetter, "Network coding from a network flow perspective," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, June 2003, p. 441.
9. 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. Inform. Theory, submitted for publication.
10. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, pp. 782-795, Oct. 2003.
11. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, pp. 371-381, Feb. 2003.
12. Z. Lie, "A short disproof of Euler's conjecture concerning orthogonal latin squares," Ars Combin., vol. 14, pp. 47-55, 1982.
13. J. H. van Lint and R. M. Wilson, A Course in Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 1992.
14. M. Médard, M. Effros, T. Ho, and D. Karger, "On coding for non-multicast networks," in Proc. 41st Annu. Allerton Conf. Communication Control and Computing, Monticello, IL, Oct. 2003.
15. A. Rasala Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 41st Annu. Allerton Conf. Communication Control and Computing, Monticello, IL, Oct. 2003.
16. S. Riis, "Linear versus non-linear Boolean functions in network flow," in Proc. 38th Annu. Conf. Information Sciences and Systems (CISS), Princeton Univ., Princeton, NJ, Mar. 2004, pp. 263-268. Paper 603.
17. D. R. Stinson, "A short proof of the nonexistence of a pair of orthogonal latin squares of order six," J. Combin. Theory, ser. A, vol. 36, pp. 373-376, 1984.
18. G. Tarry, "Le problème des 36 officiers," C. R. Assoc. France Av. Sci., pt. 2, vol. 29, pp. 170-203, 1900.
19. R. W. Yeung, A First Course in Information Theory. Norwell, MA: Kluwer, 2002.