On base field of linear network coding

IEEE Transactions on Information Theory

Volumn 62, Issue 12, 2016, Pages 7272-7282

  Sun, Qifu Tyler ^a   Li, Shuo Yen Robert ^b   Li, Zongpeng ^c,d  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^b UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^c UNIVERSITY OF CALGARY   (Canada)

^d WUHAN UNIVERSITY   (China)

Author keywords

coset; generalized Cauchy Davenport theorem; multicast network; multiplicative subgroup; Network coding

Indexed keywords

ALGEBRA; LINEAR NETWORKS; MULTICASTING;

ALGEBRAIC IDENTITIES; COSET; EXPLICIT FORMULA; GENERALIZED CAUCHY-DAVENPORT THEOREM; MULTICAST NETWORK; MULTIPLICATIVE SUBGROUP; ORDERING CRITERIA; TOPOLOGICAL STRUCTURE;

NETWORK CODING;

EID: 85000384275     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2016.2613988     Document Type: Conference Paper

References (24)

1. 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
2. R. Koetter, and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003
3. T. Ho, D. Karger, M. Medard, and R. Koetter, "Network coding from a network flow perspective," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Yokohama, Japan, Jun. 2003, p. 441
4. M. Feder, D. Ron, and A. Tavory, "Bounds on linear codes for network multicast," in Proc. Electron. Colloq. Comput. Complex. (ECCC), vol. 33. 2003, pp. 1-9
5. A. R. Lehman, and E. Lehman, "Complexity classification of network information flow problems," in Proc. 14th Annu. Symp. Discrete Algorithms (SODA), New Orleans, LA, USA, Jan. 2004, pp. 142-150
6. 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
7. 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
8. N. J. A. Harvey, D. R. Karger, and K. Murota, "Deterministic network coding by matrix completion," in Proc. Annu. ACM-SIAM Symp. Discrete Algorithm, 2005, pp. 489-498
9. C. Fragouli, and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, Mar. 2006
10. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput, and alphabet size in network coding," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2410-2424, Jun. 2006
11. M. Langberg, A. Sprintson, and J. Bruck, "Network coding: A computational perspective," IEEE Trans. Inf. Theory, vol. 55, no. 1, pp. 147-157, Jan. 2009
12. R. W. Yeung, "A unification of network coding, and routing," in Proc. Inf. Theory Appl. Workshop (ITA), Feb. 2012, pp. 246-248
13. C. K. Ngai, and R. W. Yeung, "Network Coding gain of combination networks," in Proc. IEEE Inf. Theory Workshop (ITW), Oct. 2004, pp. 283-287
14. M. Xiao, M. Medard, and T. Aulin, "A binary coding approach for combination networks, and general erasure networks," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2007, pp. 786-790
15. 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
16. R. Dougherty, C. Freiling, and K. Zeger, "Linear network codes, and systems of polynomial equations," in Proc. IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2303-2316, May 2008
17. B. K. Rai, and B. K. Dey, "On network coding for sum-networks," IEEE Trans. Inf. Theory, vol. 58, no. 1, pp. 50-63, Jan. 2012
18. Q. T. Sun, X. Yin, Z. Li, and K. Long, "Multicast network coding, and field sizes," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, HI, USA, Jun. 2014, pp. 2157-2161
19. Q. T. Sun, X. Yin, Z. Li, and K. Long, "Multicast network coding, and field sizes," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 6182-6191, Nov. 2015
20. D. S. Dummit, and R. M. Foote, Abstract Algebra, 2nd ed. New York, NY, USA: Wiley, 1999
21. M. B. Nathanson, Additive Number Theory: Inverse Problems Geometry Sumsets, New York, NY, USA: Springer, 1996
22. 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
23. Great Internet Mersenne Prime Search (GIMPS) Project, accessed on Sep. 16, 2016. [Online]. Available: http://www.mersenne.org/default.php
24. E. M. Stein, and R. Shakarchi, Fourier Analysis: An Introduction, Princeton, NJ, USA: Princeton Univ. Press, 2003