-
1
-
-
0034229404
-
Network informa-tion flow
-
Jul.
-
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network informa-tion flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
-
(2000)
IEEE Trans. Inf. Theory
, vol.46
, Issue.4
, pp. 1204-1216
-
-
Ahlswede, R.1
Cai, N.2
Li, S.-Y.R.3
Yeung, R.W.4
-
2
-
-
0037323073
-
Linear network coding
-
Feb.
-
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.
-
(2003)
IEEE Trans. Inf. Theory
, vol.49
, Issue.2
, pp. 371-381
-
-
Li, S.-Y.R.1
Yeung, R.W.2
Cai, N.3
-
3
-
-
0242334165
-
An algebraic approach to network coding
-
Oct.
-
R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
-
(2003)
IEEE/ACM Trans. Netw.
, vol.11
, Issue.5
, pp. 782-795
-
-
Koetter, R.1
Medard, M.2
-
4
-
-
0142008000
-
The benefits of coding over routing in a randomized setting
-
Yokohama, Japan, Jun./Jul.
-
T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE International Symposium on Information Theory (ISIT '03).,Yokohama, Japan, Jun./Jul. 2003, p. 442.
-
(2003)
Proc. IEEE International Symposium on Information Theory (ISIT '03)
, pp. 442
-
-
Ho, T.1
Koetter, R.2
Medard, M.3
Karger, D.R.4
Effros, M.5
-
5
-
-
33947399169
-
A random linear network coding approach to multicast
-
Oct.
-
T. Ho, M. Medard, R. Koetter, M. Effros, J. Shi, and B. leong, "A random linear network coding approach to multicast," IEEE Trans. Inf Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
-
(2006)
IEEE Trans. Inf Theory
, vol.52
, Issue.10
, pp. 4413-4430
-
-
Ho, T.1
Medard, M.2
Koetter, R.3
Effros, M.4
Shi, J.5
Leong, B.6
-
6
-
-
20544449877
-
Practical network coding
-
Monticello, IL,' USA, Oct.
-
P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL,' USA, Oct. 2003, pp. 40-49.
-
(2003)
Proc. 41st Annual Allerton Conference on Communication, Control, and Computing
, pp. 40-49
-
-
Chou, P.A.1
Wu, Y.2
Jain, K.3
-
7
-
-
39049112552
-
Analyzing and improving a BitTorrent network's performance mechanisms
-
Barcelona, Spain, Apr.
-
A. R. Bharambe, C. Herly, and V. N. Padmanabhan, "Analyzing and improving a BitTorrent network's performance mechanisms," in Proc. the 25th IEEE International Conference on Computer Communications (INFOCOM '06)., Barcelona, Spain, Apr. 2006, pp. 1-12.
-
(2006)
Proc. The 25th IEEE International Conference on Computer Communications (INFOCOM '06)
, pp. 1-12
-
-
Bharambe, A.R.1
Herly, C.2
Padmanabhan, V.N.3
-
8
-
-
51249109338
-
Swifter: Chunked network coding for peer-to-peer content distribution
-
Beijing, China, May
-
J. Xu, J. Zhao, X. Wang, and X. Xue, "Swifter: Chunked network coding for peer-to-peer content distribution," in Proc. IEEE International Conference on Communication (ICC '08), Beijing, China, May 2008, pp. 5603-5608.
-
(2008)
Proc. IEEE International Conference on Communication (ICC '08)
, pp. 5603-5608
-
-
Xu, J.1
Zhao, J.2
Wang, X.3
Xue, X.4
-
9
-
-
84866708184
-
Methods for efficient network coding
-
Monticello, IL, USA, Sep.
-
P. Maymounkov, N. Harvey, and D. S. Lun, "Methods for efficient network coding," in Proc. 44th Annual Allerton Conference on Com-munication, Control, and Computing, Monticello, IL, USA, Sep. 2006, pp. 482-491.
-
(2006)
Proc. 44th Annual Allerton Conference on Com-munication, Control, and Computing
, pp. 482-491
-
-
Maymounkov, P.1
Harvey, N.2
Lun, D.S.3
-
10
-
-
79251485294
-
Effect of the generation size and overlap on throughput and complexity in randomized linear network coding
-
Feb.
-
Y. Li, E. Soljanin, and P. Spasojevć, "Effect of the generation size and overlap on throughput and complexity in randomized linear network coding," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1111-1123, Feb. 2011.
-
(2011)
IEEE Trans. Inf. Theory
, vol.57
, Issue.2
, pp. 1111-1123
-
-
Li, Y.1
Soljanin, E.2
Spasojevć, P.3
-
11
-
-
77950820230
-
Sparse network coding with overlapping classes
-
Lausanne, Switzeland, Jun.
-
D. Silva, W. Zeng, and F. Kschischang, "Sparse network coding with overlapping classes," in Proc. Workshop on Network Coding, Theory, and Applications (NetCod '09), Lausanne, Switzeland, Jun. 2009, pp. 74-79.
-
(2009)
Proc. Workshop on Network Coding, Theory, and Applications (NetCod '09)
, pp. 74-79
-
-
Silva, D.1
Zeng, W.2
Kschischang, F.3
-
12
-
-
77954824311
-
Overlapped chuncked network coding
-
Cairo, Egypt, Jan.
-
A. Heidarzadeh and A. H. Banihashemi, "Overlapped chuncked network coding," in Proc. IEEE Information Theory Workshop (ITW '10), Cairo, Egypt, Jan. 2010, pp. 1-5.
-
(2010)
Proc. IEEE Information Theory Workshop (ITW '10)
, pp. 1-5
-
-
Heidarzadeh, A.1
Banihashemi, A.H.2
-
13
-
-
0036913621
-
Capacity-achieving sequences for era-sure channel
-
Dec.
-
P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for era-sure channel," IEEE Trans. Inf Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
-
(2002)
IEEE Trans. Inf Theory
, vol.48
, Issue.12
, pp. 3017-3028
-
-
Oswald, P.1
Shokrollahi, A.2
-
14
-
-
84957715479
-
New sequences of linear time erasure codes approaching the channel capacity
-
London, UK: Springer-Verlag
-
M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. The 13th International Sym-posium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-13), London, UK: Springer-Verlag, 1999, pp. 65-76.
-
(1999)
Proc. The 13th International Sym-posium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-13)
, pp. 65-76
-
-
Shokrollahi, M.A.1
-
15
-
-
33745166587
-
Raptor codes,"
-
Jun.
-
A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
-
(2006)
IEEE Trans. Inf. Theory
, vol.52
, Issue.6
, pp. 2551-2567
-
-
Shokrollahi, A.1
-
16
-
-
0036953758
-
LT codes
-
Vancouver, BC, Canada, Nov.
-
M. Luby, "LT codes," in Proc. the 43rd Annu. IEEE Symposium on Foundations of Computer Science (FOCS)., Vancouver, BC, Canada, Nov. 2002, pp. 271-280.
-
(2002)
Proc. The 43rd Annu. IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 271-280
-
-
Luby, M.1
-
17
-
-
84866661702
-
A generalization of a result of Erdos and Renyi
-
N. Kaplan, "A generalization of a result of Erdos and Renyi," Journal of Applied Probability, vol. 14, pp. 212-216, 1977.
-
(1977)
Journal of Applied Probability
, vol.14
, pp. 212-216
-
-
Kaplan, N.1
-
18
-
-
9944260389
-
Limit theorems for some random variables associated with urn models
-
L. Flatto, "Limit theorems for some random variables associated with urn models," The Annals of Probability, vol. 10, no. 4, pp. 927-934, 1982.
-
(1982)
The Annals of Probability
, vol.10
, Issue.4
, pp. 927-934
-
-
Flatto, L.1
-
19
-
-
0005160864
-
Some high-rate near capacity codecs for the gaussian channel
-
Monticello, IL, USA, Oct.
-
J. F. Cheng and R. J. Mceliece, "Some high-rate near capacity codecs for the gaussian channel," in Proc. 34th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, Oct. 1996, pp. 494-503.
-
(1996)
Proc. 34th Annual Allerton Conference on Communication, Control, and Computing
, pp. 494-503
-
-
Cheng, J.F.1
Mceliece, R.J.2
|