A family of optimal locally recoverable codes

IEEE Transactions on Information Theory

Volumn 60, Issue 8, 2014, Pages 4661-4676

  Tamo, Itzhak ^a   Barg, Alexander ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

Author keywords

Distributed storage; erasure recovery; evaluation codes; hot data

Indexed keywords

DIGITAL STORAGE; RECOVERY; REED-SOLOMON CODES;

DISTRIBUTED STORAGE; EVALUATION CODES; FINITE ALPHABET; HIGH AVAILABILITY; HOT DATA; POLYNOMIAL INTERPOLATION; RECOVERY PROCEDURE; RECOVERY PROCESS;

CODES (SYMBOLS);

EID: 84904709057     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2321280     Document Type: Article

References (28)

1. N. Alon and J. Spencer, The Probabilistic Method. Hoboken, NJ, USA: Wiley, 2008.
2. A. Barg and G. Zémor, "Concatenated codes: Serial and parallel," IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1625-1634, May 2005. (Pubitemid 40654441)
3. M. Blaum, J. L. Hafner, and S. Hetzler, "Partial-MDS codes and their application to RAID type of architectures," IEEE Trans. Inf. Theory, vol. 59, no. 7, pp. 4510-4519, Jul. 2013.
4. V. Cadambe and A. Mazumdar, "An upper bound on the size of locally recoverable codes," in Proc. IEEE Symp. Netw. Coding, Jun. 2013, pp. 1-5.
5. V. R. Cadambe, C. Huang, H. Maleki and K. Ramchandran, "Asymptotic interference alignment for optimal repair of MDS codes in distributed storage," IEEE Trans. Inf. Theory, vol. 58, no. 5, pp. 2974-2987, May 2013.
6. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4539-4551, Sep. 2010.
7. M. Forbes and S. Yekhanin, "On the locality of codeword symbols in non-linear codes," arXiv:1303:3921.
8. P. Gopalan, C. Huang, B. Jenkins, and S. Yekhanin, "Explicit maximally recoverable codes with locality," arxiv:1307.3150.
9. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," IEEE Trans. Inf. Theory, vol. 58, no. 11, pp. 6925-6934, Nov. 2012.
10. J. Han and L. A. Lastras-Montano, "Reliable memories with subline accesses," in Proc. IEEE ISIT, Jun. 2007, pp. 2531-2535.
11. C. Huang, M. Chen, and J. Li, "Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems," in Proc. 6th IEEE Int. Symp. NCA, Jul. 2007, pp. 79-86.
12. G. M. Kamath, N. Prakash, V. Lalitha, and P. V. Kumar, "Codes with local regeneration," in Proc. IEEE Int. Symp. Inform. Theory, Istanbul, Turkey, Jul. 2013, pp. 1606-1610.
13. O. Khan, R. Burns, J. Plank, and C. Huang, "In search of I/O-optimal recovery from disk failures," in Proc. 3rd Workshop Hot Topics Storage File Syst., Jun. 2011.
14. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1991.
15. A. Mazumdar, V. Chandar, and G. W. Wornell, "Update efficiency and local repairability limits for capacity-achieving codes," IEEE J. Sel. Areas Commun., vol. 32, no. 5, pp. 976-988, May 2014.
16. F. Oggier and A. Datta, "Self-repairing homomorphic codes for distributed storage systems," in Proc. IEEE INFOCOM, Apr. 2011, pp. 1215-1223.
17. L. Pamies-Juarez, H. D. L. Hollmann, and F. Oggier, "Locally repairable codes with multiple repair alternatives," in Proc. IEEE ISIT, Istanbul, Turkey, Jul. 2013, pp. 892-896.
18. D. S. Papailiopoulos, A. G. Dimakis, and V. R. Cadambe, "Repair optimal erasure codes through hadamard designs," in Proc. 49th Annu. Allerton Conf. Commun., Control, Comput., Sep. 2011, pp. 1382-1389.
19. D. S. Papailiopoulos, J. Luo, A. G. Dimakis, C. Huang, and J. Li, "Simple regenerating codes: Network coding for cloud storage," in Proc. IEEE INFOCOM, Mar. 2012, pp. 2801-2805.
20. D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes," in Proc. IEEE ISIT, Jul. 2012, pp. 2771-2775.
21. N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, "Optimal linear codes with a local-error-correction property," in Proc. IEEE ISIT, Jul. 2012, pp. 2776-2780.
22. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5227-5239, Aug. 2011.
23. K. V. Rashmi, N. B. Shah, and K. Ramchandran, "A piggybacking design framework for read-and download-efficient distributed storage codes," in Proc. IEEE ISIT, Jul. 2013, pp. 331-335.
24. N. Silberstein, A. S. Rawat, O. O. Koyluoglu, and S. Vishwanath, "Optimal locally repairable codes via rank-metric codes," in Proc. IEEE ISIT, Jul. 2013, pp. 1819-1823.
25. C. Suh and K. Ramchandran, "Exact-repair MDS code construction using interference alignment," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1425-1442, Mar. 2011.
26. I. Tamo, D. S. Papailiopoulos, and A. G. Dimakis, "Optimal locally repairable codes and connections to matroid theory," in Proc. IEEE ISIT, Jul. 2013, pp. 1814-1818.
27. I. Tamo, Z. Wang, and J. Bruck, "Zigzag codes: MDS array codes with optimal rebuilding," IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1597-1616, Mar. 2013.
28. I. Tamo and A. Barg, "Bounds on locally recoverable codes with multiple recovering sets," in Proc. IEEE ISIT, Honolulu, Hawaii, Jul. 2014.