Locally repairable codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 2771-2775

  Papailiopoulos, Dimitris S ^a   Dimakis, Alexandros G ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABILITY; CODE DISTANCE; DISTRIBUTED STORAGE; ENCODED INFORMATION; EXPLICIT CONSTRUCTIONS; HIGH DATA RATE; HIGH DATA-RATES; LOCALITY AWARE; LOW COSTS; RANDOMIZED CODE; STORAGE COSTS;

INFORMATION THEORY;

REPAIR;

EID: 84867533183     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6284027     Document Type: Conference Paper

References (18)

1. The Coding for Distributed Storage wiki http://tinyurl.com/storagecoding
2. A. G. Dimakis, P. G. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in IEEE Trans. on Inform. Theory, vol. 56, pp. 4539-4551, Sep. 2010.
3. A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A survey on network codes for distributed storage," in IEEE Proceedings, vol. 99, pp. 476-489, Mar. 2011.
4. O. Khan, R. Burns, J. Plank, and C. Huang, "In search of I/O-optimal recovery from disk failures," in Hot Storage 2011, 3rd Workshop on Hot Topics in Storage and File Systems, Portland, OR, Jun., 2011.
5. H. Weatherspoon and J. D. Kubiatowicz, "Erasure coding vs. replication: a quantitative comparison," in Proc. IPTPS, 2002.
6. F. Oggier and A. Datta, "Self-repairing homomorphic codes for distributed storage systems," in Proc. IEEE Infocom 2011, Shanghai, China, Apr. 2011.
7. K.V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran "Explicit construction of optimal exact regenerating codes for distributed storage," In Allerton Conf. on Control, Comp., and Comm., Urbana-Champaign, IL, September 2009.
8. C. Suh and K. Ramchandran, "Exact regeneration codes for distributed storage repair using interference alignment," in Proc. 2010 IEEE Int. Symp. on Inform. Theory (ISIT), Seoul, Korea, Jun. 2010.
9. K. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a productmatrix construction," in IEEE Trans. on Inform. Theory, vol. 57, pp. 5227-5239, Jul. 2011.
10. I. Tamo, Z. Wang, and J. Bruck "MDS Array Codes with Optimal Rebuilding," in Proc. IEEE Intern. Symp. on Inform. Theory (ISIT) 2001, St. Petersburg, Russia, Aug. 2011.
11. V. R. Cadambe, C. Huang, S. A. Jafar, and J. Li, "Optimal repair of MDS codes in distributed storage via subspace interference alignment," arxiv pre-print 2011. Preprint available at http://arxiv.org/abs/1106.1250.
12. D. S. Papailiopoulos, A. G. Dimakis, and V. R. Cadambe, "Repair optimal erasure codes through Hadamard designs," In Allerton Conf. on Control, Comp., and Comm., Urbana-Champaign, IL, September 2011.
13. C. Huang, M. Chen, and J. Li, "Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems", in Proc. IEEE International Symposium on Network Computing and Applications (NCA 2007), Cambridge, MA, Jul. 2007.
14. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword elements," Preprint available at http://arxiv.org/abs/1106. 3625.
15. D. S. Papailiopoulos, Jianqiang Luo, Alexandros G. Dimakis, C. Huang, and J. Li, "Simple regenerating codes: network coding for cloud storage", in IEEE International Conference on Computer Communications (Infocom) 2012, Miniconference.
16. T. Ho, R. Koetter, M. Médard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast," IEEE Transactions on Information Theory, vol. 52 (10), pp. 4413-4430, Oct. 2006.
17. D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes," full version available at http://tinyurl.com/82cucvd
18. J. Han and L. A. Lastras-Montaño, "Reliable memories with subline accesses" in Proc. 2010 IEEE Int. Symp. on Inform. Theory (ISIT), pp. 2531-2535, 2007.