Ahlswede R, Cai N, Li S Y R, et al. Network information flow[J]. IEEE Trans on Information Theory, 2000, 46(4): 1204-1216.
[2]
Dimakis A G, Prabhakaran V. Decentralized erasure codes for distributed networked storage[J]. IEEE Trans on Information Theory, 2006, 52(4): 2809-2816.
[3]
Rhea S, Eaton P, Kubiatowicz J, et al. Pond: the OceanStore prototype//Proceedings of the 2nd USENIX Conference on File and Storage Technologies. San Franisco: ACM Press, 2003: 1-14.
[4]
Acedanski S, Deb S, Medard M, et al. How good is random linear coding based distributed networked storage//Proceedings of First Workshop on Network Coding. : IEEE Press, 2005: 199-125.
[5]
Luby M. LT codes//The 43rd Annual IEEE Symposium on Foundations of Computer Science. Vancouver: IEEE Press, 2002: 271-280.
[6]
Shokrollah A. Raptor codes[J]. IEEE Trans on Information Theory, 2006, 52(6): 2551-2567.
[7]
Raab M, Steger A. Balls into Bins—a simple and tight analysis//Proceedings of the 2nd Randomization and Approximation Techniques in Computer Science. London: Springer-Verlag, 1998: 159-170.
[8]
Bollobas B. Random graphs[M]. Cambridge: Cambridge University Press, 2001: 171-179.
