Explicit codes minimizing repair bandwidth for distributed storage

IEEE Information Theory Workshop 2010, ITW 2010

Volumn , Issue , 2010, Pages

  Shah, Nihar B ^a   Rashmi, K V ^a   Kumar, P Vijay ^a   Ramchandran, Kannan ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED STORAGE; FAILED NODES; OPTIMAL CONSTRUCTION;

INFORMATION THEORY; OPTIMIZATION;

REPAIR;

EID: 77954825042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWKSPS.2010.5503165     Document Type: Conference Paper

References (6)

1. Y. Wu, A. G. Dimakis and K. Ramchandran, "Deterministic Regenerating Codes for Distributed Storage," Proc. Allerton Conf., Sep. 2007.
2. Y. Wu and A. Dimakis, "Reducing Repair Traffic for Erasure Coding-Based Storage via Interference Alignment," Proc. ISIT, Jul. 2009.
3. K. V. Rashmi, N. B. Shah, P. V. Kumar and K. Ramchandran, "Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage," Proc. Allerton Conf., Sep 2009.
4. N. B. Shah, K. V. Rashmi, P. V. Kumar and K. Ramchandran,"Explicit Codes Minimizing Repair Bandwidth for Distributed Storage". Available online at arXiv:0908.2984 [cs.IT]
5. R. Koetter and M. Medard, "An Algebraic Approach to Network Coding," IEEE/ACM Transactions on Networking, v.11 n.5, p.782-795, Oct. 2003.
6. Dennis S. Bernstein, Matrix Mathematics, Princeton University Press, Princeton, NJ, p.119, 2005.