1 |
S. Jaggi et al., "Polynomial time algorithms for multicast network code construction," Inf. Theory IEEE Trans, Vol. 51, No. 6, pp. 1973-1982, 2005.
DOI
|
2 |
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pp. 286-294, 2003.
|
3 |
Y. Zhu, B. Li, and J. Guo, "Multicast with network coding in application-layer overlay networks," IEEE J. Sel. Areas Commun., Vol. 22, No. 1, pp. 107-120, 2004.
DOI
|
4 |
T. Shaoguo, H. Jiaqing, Y. Zongkai, R. S. Youail, and C. Wenqing, "Routing algorithm for network coding based multicast," in Proc. of Convergence Information Technology International Conference, pp. 2091-2095, 2007.
|
5 |
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network flows: theory, algorithms, and applications," 1993.
|
6 |
T. H. Cormen, Introduction to algorithms. MIT press, 2009.
|
7 |
L. Wu and K. Curran, "A practical network coding and routing scheme based on maximum flow combination," Int. J. Netw. Manag., Vol. 22, No. 5, pp. 373-396, 2012.
DOI
|
8 |
D. Tang, X. Lu, y J. Li, "Multicast routing algorithm based on network coding," in Proc. of International Conference on Brain Inspired Cognitive Systems, pp. 348-357, 2013.
|
9 |
T. Ho and D. Lun, Network coding: an introduction. Cambridge University Press, 2008.
|
10 |
K. Menger, "Zur allgemeinen Kurventheorie," Fundam. Math., Vol. 10, No. 1, pp. 96-115, 1927.
DOI
|
11 |
S. I. Grossman, Elementary linear algebra. Brooks/Cole Publishing Company, 1994
|
12 |
R. J. Wilson, An introduction to graph theory. Pearson Education India, 1970.
|
13 |
"GitHub - Z3Prover/z3: The Z3 Theorem Prover," https://github.com/Z3Prover/z3
|
14 |
A. Sprintson, "Network coding and its applications in communication networks," Algorithms for Next Generation Networks, Springer, pp. 343-372, 2010.
|
15 |
S. Knight et al., "Virtual router redundancy protocol," 1998. https://tools.ietf.org/html/rfc2338
|
16 |
R. Ahlswede, N. Cai, S.-Y. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, Vol. 46, No. 4, pp. 1204-1216, 2000.
DOI
|
17 |
R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE ACM Trans. Netw. TON, Vol. 11, No. 5, pp. 782-795, 2003.
DOI
|
18 |
S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," Inf. Theory IEEE Trans., Vol. 49, No. 2, pp. 371-381, 2003.
DOI
|
19 |
P. A. Chou and Y. Wu, "Network coding for the internet and wireless networks," IEEE Signal Process. Mag., Vol. 24, No. 5, pp. 77-85, 2007.
DOI
|
20 |
B. Li and Y. Wu, "Network coding [scanning the issue]," Proc. IEEE, Vol. 99, No. 3, pp. 363-365, 2011.
DOI
|
21 |
R. W. Yeung and N. Cai, Network coding theory. Now Publishers Inc, 2006.
|
22 |
C. Fragouli, J.-Y. Le Boudec, and J. Widmer, "Network coding: an instant primer," ACM SIGCOMM Comput. Commun. Rev., Vol. 36, No. 1, pp. 63-68, 2006.
DOI
|
23 |
G. Dantzig and D. R. Fulkerson, "On the max flow min cut theorem of networks," Linear Inequalities Relat. Syst., Vol. 38, pp. 225-231, 2003.
|
24 |
R. W. Yeung, "Network coding: A historical perspective," Proc. IEEE, Vol. 99, No. 3, pp. 366-371, 2011.
DOI
|
25 |
P. Elias, A. Feinstein, and C. Shannon, "A note on the maximum flow through a network," IRE Trans. Inf. Theory, Vol. 2, No. 4, pp. 117-119, 1956.
DOI
|
26 |
L. R. Ford and D. R. Fulkerson, "Maximal flow through a network," Classic papers in combinatorics, pp. 243-248, 1987.
|
27 |
R. Lidl and H. Niederreiter, Finite fields, vol. 20. Cambridge university press, 1997.
|
28 |
R. Koetter and M. Medard, "Beyond routing: An algebraic approach to network coding," in Proc. of INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 1, pp. 122-130, 2002.
|
29 |
S. Jaggi, P. A. Chou, and K. Jain, "Low complexity optimal algebraic multicast codes," in Proc. of IEEE Int'l Symp. Information Theory, Yokohama, Japan, 2003.
|