Linear network codes and systems of polynomial equations

IEEE Transactions on Information Theory

Volumn 54, Issue 5, 2008, Pages 2303-2316

  Dougherty, Randall ^a   Freiling, Chris ^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

Flow; Information theory; Matroids; Network coding; Polynomial equations

Indexed keywords

COMPUTATIONAL METHODS; ENCODING (SYMBOLS); INFORMATION THEORY; SET THEORY;

ACYCLIC NETWORK; MULTIPLE-UNICAST MATROIDAL NETWORK; NETWORK CODING; POLYNOMIAL COLLECTION;

POLYNOMIALS;

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

References (25)

1. R. Baines and P. Vámos, "An algorithm to compute the set of characteristics of a system of polynomial equations over the integers." J. Symb. Comput., vol. 35, pp. 269-279, 2003.
2. T. Becker, V. Weispfenning, and H. Kredel, Gröbner Bases: A Computational Approach to Commutative Algebra. New York: Springer-Verlag, 1993.
3. L. M. Blumenthal, A Modern View of Geometry. New York: Dover, 1961.
4. M. Davis, "Hilbert's tenth problem is unsolvable," Amer. Math. Monthly, vol. 80, pp. 233-269, 1973.
5. R. Dougherty, C. Freiling, and K. Zeger, "Linearity and solvability in multicast networks," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2243-2256, Oct. 2004.
6. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
7. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity," IEEE Trans. Inf. Theory (Joint issue with IEEE/ACM Trans. Netw.), vol. 52, no. 6, pp. 2365-2372, Jun. 2006.
8. R. Dougherty, C. Freiling, and K. Zeger, "Networks, matroids, and non-Shannon information inequalities," IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 1949-1969, Jun. 2007.
9. R. Dougherty and K. Zeger, "Nonreversibility and equivalent constructions of multiple-unicast networks," IEEE Trans. Inf. Theory vol. 52, no. 11, pp. 5067-5077, Nov. 2006.
10. M. Feder, D. Ron, and A. Tavory, "Bounds on linear codes for network multicast," in Proc. Electronic Colloquium on Computational Complexity (ECCC), 2003, pp. 1-9.
11. C. Fragouli and E. Soljanin, Network Coding Fundamentals. Boston, MA: Now Publishers, 2007.
12. 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, Jun. 2003, p. 441.
13. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory. New York: Springer-Verlag, 1990.
14. 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.
15. 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.
16. 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.
17. S. MacLane, "Some interpretations of abstract linear dependence in terms of projective geometry," Amer. J. Math., vol. 58, no. 1, pp. 236-240, Jan. 1936.
18. Y. V. Matiyasevich, Hilbert's Tenth Problem. Cambridge, MA: MIT Press, 1993.
19. M. Médard, M. Effros, T. Ho, and D. Karger, "On coding for nonmulticast networks," in Proc. 41st Annu. Allerton Conf. Communication Control and Computing, Monticello, IL, Oct. 2003.
20. J. G. Oxley, Matroid Theory. New York: Oxford Univ. Press, 1992.
21. A. L. Rasala and E. Lehman, "Complexity classification of network information flow problems," in Proc. 41st Annu. Allerton Conf. Communication Control and Computing, Monticello, IL, Oct. 2003.
22. S. Riis, "Linear versus nonlinear boolean functions in network flow," in Proc. 38th Annu. Conf. Information Sciences and Systems (CISS), Princeton, NJ, Mar. 2004.
23. N. L. White, Ed., Combinatorial Geometries, Encyclopedia of Mathematics and Its Applications. Cambridge, U.K.: Cambridge Univ. Press, 1987.
24. R. W. Yeung, A First Course in Information Theory. Boston, MA: Kluwer, 2002.
25. R. W. Yeung, R. S.-Y. Li, N. Cai and Z. Zhang, Network Coding Theory Boston, MA: Now Publishers, 2006.