Existence and construction of capacity-achieving network codes for distributed storage

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1150-1154

  Wu, Yunnan ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE CONSTRUCTION; DISTRIBUTED STORAGE; DISTRIBUTED STORAGE SYSTEM; ERASURE CODES; ERASURE CODING; FINITE FIELDS; INFORMATION FLOWS; NETWORK BANDWIDTH; NETWORK CODES; NETWORK CODING; NETWORK TRAFFIC; OPTIMAL CODES; OPTIMAL TRADEOFFS; STORAGE EFFICIENCY; STORAGE NODES; STORAGE SYSTEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY); GRAPH THEORY; INTERNET;

REPAIR;

EID: 70449514563     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5206008     Document Type: Conference Paper

References (6)

1. A. G. Dimakis, P. G. Godfrey, M. J. Wainwright, and K. Ramchandran, "Network coding for peer-to-peer storage," in IEEE Proc. INFOCOM, Anchorage, Alaska, May 2007.
2. Y Wu, A. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage," in Allerton Conference on Control, Computing, and Communication, Monticello, IL, October 2007.
3. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. on Information Theory, vol. 49, pp. 371-381, February 2003.
4. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
5. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
6. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for network code construction," IEEE Trans. Inform. Theory, vol. 51, pp. 1973-1982, Jun. 2005.