1 |
K. Jain, M. Mahdian, and M. R. salavatipour, 'Packing Steiner trees,' Symposium on Discrete Algorithms, 2003
|
2 |
S.-Y. R. Li, R. W . Yeung, and N. Cai, 'Linear network coding,' IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003
DOI
ScienceOn
|
3 |
C. Fragouli and E. Soljanin, Network coding fundamentals, now Publishers, Inc., 2007
|
4 |
S. Jaggi, et al., 'Polynomial time algorithms for multicast network code construction,' IEEE Transactions on Information Theory, vol, 51, no. 6, pp. 1973-1982, June 2005
DOI
ScienceOn
|
5 |
R. Koetter and F. Kschischang, 'Coding for errors and erasures in random network coding,' IEEE International Symposium on Information Theory (ISIT2007), Nice, France, June 2007
|
6 |
C. Chekuri, C, Fragouli, and E. Soljanin, 'On average throughput and alphabet size in network coding,' IEEE Transactions on Information Theory, vol, 52, no. 6, pp. 2410-2424, June 2006
DOI
ScienceOn
|
7 |
C. Hausl, et al., 'Iterative network and channel decoding on a tanner graph,' Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep, 2005
|
8 |
L. Xiao, T. E. Fuja, J. Kliewer, and D. J. Costello, 'A network coding approach to cooperative diversity,' IEEE Transactions on Information Theory, vol, 53, no. 10, pp. 3714-3722, Oct. 2007
DOI
ScienceOn
|
9 |
D. Petrovic, K. Ramchandran, and J. Rabaey, 'Overcoming untuned radios in wireless networks with network coding,' IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2649-2657,June 2006
DOI
ScienceOn
|
10 |
X. Yan, R. W. Yeung, and Z. Zhang, 'The capacity region for multi-source multi-sink network coding,' ISIT, Nice, France,June 2007
|
11 |
P. A. Chou and Y. Wu, 'Network coding for the internet and wireless networks,' IEEE Signal Processing Magazine, vol, 24, no. 5, pp. 77-85, Sep, 2007
|
12 |
T. Ho, M. Medard, M. Effros, and R. Koetter, 'Newark coding for correlated sources ,' CISS, Princeton, NJ, Mar. 2004
|
13 |
L. R. Ford and D. R. Fulkerson, 'Maximal flow through a network,' Canadian Journal of Mathematics, vol, 8, pp. 399-404, 1956
DOI
|
14 |
R. Koetter and M. Medard, 'An algebraic approach to network coding,' IEEE/ACM Transactions on , Networking, vol. 11, no, 5, pp. 782-795, Oct. 2003
DOI
ScienceOn
|
15 |
J. T. Schwartz, 'Fast probabilistic algorithms for verification of polynomial identities,' Journal of the ACM, vol, 27, no. 4, pp. 701-717, Oct. 1980
DOI
|
16 |
P. A. Chou, Y. Wu, and K. Jain, 'Practical network coding,' Allerton Conference on Communication, Control, and Computing, Monticello, IL, Oct. 2003
|
17 |
C. Gkantsidis and P. R. Rodriguez, 'Network coding for large scale content distribution,' INFOCOM, Miami, FL, Mar. 2005
|
18 |
J. Edmonds and R. M. Karp, 'Theoretical improvements in algoritlunic efficiency for network flow problems,' Journal of the Association for Computing Machinery, vol, 19, no. 2, pp. 248-264, Apr. 1972
DOI
|
19 |
B. Zhao and M. C. Valenti, 'Distributed turbo coded diversity for relay channel,' Electronics Letters, vol. 39, no. 10, pp. 786-787, May 2003
DOI
ScienceOn
|
20 |
T. Ho, et al., 'A random linear network coding approach to multicast,' IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006
DOI
ScienceOn
|
21 |
M. Langber, A. Sprintson, and J. Bruck, 'The encoding complexity of network coding,' IEEE/ACM Transactions on Networking, vol, 14, pp. 2386-2397, June 2006
|
22 |
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, 'Network information flow,' IEEE Transactions on Information Theory, vol, 46, no. 4, pp. 1204-1216, July 2000
DOI
ScienceOn
|
23 |
C. Gkantsidis and P. R. Rodriguez, 'Cooperative security for network coding file distribution,' INFOCOM, Barcelona, Spain, Apr. 2006
|
24 |
C. Hausl and J. Hagenauer, 'Iterative network and channel decoding for the two-way relay channel,' ICC, Istanbul, Turkey,June 2006
|