An upper bound on the size of locally recoverable codes

2013 International Symposium on Network Coding, NetCod 2013

Volumn , Issue , 2013, Pages

  Cadambe, Viveck ^a   Mazumdar, Arya ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODEWORD; DISTRIBUTED STORAGE; MINIMUM DISTANCE; RECOVERABILITY; SIMPLE ANALYSIS; STORAGE NODES; UPPER BOUND;

NETWORK CODING; REPAIR;

DIGITAL STORAGE;

EID: 84883341152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NetCod.2013.6570829     Document Type: Conference Paper

References (12)

1. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin. On the locality of codeword symbols. Information Theory, IEEE Transactions on, 58(11):6925-6934, nov. 2012.
2. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin. Erasure coding in windows azure storage. In USENIX Annual Technical Conference (USENIX ATC), 2012.
3. G. M. Kamath, N. Prakash, V. Lalitha, and P. V. Kumar. Codes with local regeneration. CoRR, abs/1211. 1932, 2012. http://arxiv. org/abs/1211. 1932.
4. G. M. Kamath, N. Prakash, V. Lalitha, P. V. Kumar, N. Silberstein, A. S. Rawat, O. O. Koyluoglu, and S. Vishwanath. Explicit mbr all-symbol locality codes. arXiv preprint arXiv:1302. 0744, 2013.
5. F. MacWilliams and N. Sloane. The theory of error-correcting codes. 2006.
6. A. Mazumdar, V. Chandar, and G. W. Wornell. Local recovery properties of capacity-achieving codes. Information Theory and Applications (ITA), San Diego, Feb 2013.
7. D. S. Papailiopoulos and A. G. Dimakis. Locally repairable codes. In Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, pages 2771-2775. IEEE, 2012.
8. D. S. Papailiopoulos, J. Luo, A. G. Dimakis, C. Huang, and J. Li. Simple regenerating codes: Network coding for cloud storage. In INFOCOM, 2012 Proceedings IEEE, pages 2801-2805. IEEE, 2012.
9. A. S. Rawat, O. O. Koyluoglu, N. Silberstein, and S. Vishwanath. Optimal locally repairable and secure codes for distributed storage systems. arXiv preprint arXiv:1210. 6954, 2012.
10. R. Roth. Introduction to coding theory. Cambridge University Press, 2006.
11. M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur. Xoring elephants: Novel erasure codes for big data. arXiv preprint arXiv:1301. 3791, 2013.
12. I. Tamo, D. S. Papailiopoulos, and A. G. Dimakis. Optimal locally repairable codes and connections to matroid theory. arXiv preprint arXiv:1301. 7693, 2013.