Multicast Network Coding and Field Sizes

IEEE Transactions on Information Theory

Volumn 61, Issue 11, 2015, Pages 6182-6191

  Sun, Qifu Tyler ^a   Yin, Xunrui ^b   Li, Zongpeng ^b,c   Long, Keping ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^b UNIVERSITY OF CALGARY   (Canada)

^c WUHAN UNIVERSITY   (China)

Author keywords

field size; Linear network coding; lower bound; Mersenne prime; multicast network

Indexed keywords

CODES (SYMBOLS); LINEAR NETWORKS; MULTICASTING;

FIELD SIZE; FINITE FIELDS; LARGER FIELDS; LINEAR SOLUTION; LOWER BOUNDS; MERSENNE PRIME; MULTICAST NETWORK; MULTIPLICATIVE GROUPS;

NETWORK CODING;

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

References (23)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 1204-1216, Feb. 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, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
4. T. Ho, D. Karger, and M. Médard, "Network coding from a network flow perspective," in Proc. IEEE Int. Symp. Inf. Theory, Yokohama, Japan, Jun. 2003, pp. 1-7.
5. N. J. A. Harvey, D. R. Karger, and K. Murota, "Deterministic network coding by matrix completion," in Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), Vancouver, BC, Canada, Jan. 2005, pp. 489-498.
6. S. Jaggi et al., "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005.
7. R. W. Yeung, "A unification of network coding and routing," in Proc. Inf. Theory Appl. Workshop (ITA), Feb. 2012, pp. 246-248.
8. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, Mar. 2006.
9. M. Feder, D. Ron, and A. Tavory, "Bounds on linear codes for network multicast," in Proc. Electron. Colloq. Comput. Complex. (ECCC), 2003, pp. 1-9.
10. A. R. Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), New Orleans, LA, USA, Jan. 2004, pp. 142-150.
11. 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.
12. S.-Y. R. Li, Q. T. Sun, and Z. Shao, "Linear network coding: Theory and algorithms," Proc. IEEE, vol. 99, no. 3, pp. 372-387, Mar. 2011.
13. 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.
14. 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.
15. J. Oxley, Matroid Theory, 2nd ed. New York, NY, USA: Oxford Univ. Press, 2006.
16. R. Dougherty, C. Freiling, and K. Zeger, "Linear network codes and systems of polynomial equations," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2303-2316, May 2008.
17. Great Internet Mersenne Prime Search (GIMPS) Project. [Online]. Available: http://www.mersenne.org/default.php, accessed Sep. 3, 2015.
18. J. B. Ebrahimi and C. Fragouli, "Algebraic algorithms for vector network coding," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 996-1007, Feb. 2011.
19. J. Oxley, D. Vertigan, and G. Whittle, "On inequivalent representations of matroids over finite fields," J. Combinat. Theory B, vol. 67, no. 2, pp. 325-343, 1996.
20. Q. Sun, S. T. Ho, and S.-Y. R. Li, "On network matroids and linear network codes," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 2008, pp. 1833-1837.
21. Q. T. Sun, S.-Y. R. Li, and C. Chan, "Matroidal characterization of optimal linear network codes over cyclic networks," IEEE Commun. Lett., vol. 17, no. 10, pp. 1992-1995, Oct. 2013.
22. M. B. Nathanson, Additive Number Theory: Inverse Problems and the Geometry of Sumsets. New York, NY, USA: Springer-Verlag, 1996.
23. T. Xiahou, Z. Li, and C. Wu, "Information multicast in (pseudo-)planar networks: Efficient network coding over small finite fields," in Proc. Int. Symp. Netw. Coding (NetCod), Calgary, AB, Canada, Jun. 2013, pp. 1-6.