Codes with locality for two erasures

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2014, Pages 1962-1966

  Prakash, N ^a   Lalitha, V ^a   Kumar, P Vijay ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SYSTEMS; RECOVERY;

GENERALIZED HAMMING WEIGHT; LOCAL RECOVERIES; MINIMUM DISTANCE; MINIMUM DISTANCE BOUNDS; MINIMUM DISTANCE OF CODE; NATURAL GENERALIZATION; PARITY-CHECK EQUATIONS; SEQUENTIAL APPROACH;

CODES (SYMBOLS);

EID: 84906565397     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6875176     Document Type: Conference Paper

References (19)

1. 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.
2. 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.
3. 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. Symposium on Network Computing and Applications (NCA), 2007, pp. 79-86.
4. D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, Jul. 2012, pp. 2771-2775.
5. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure coding in windows azure storage, " in Proc.2012 USENIX Annual Technical Conference (ATC), Boston, MA, 2012, pp. 15-26.
6. I. Tamo and A. Barg, "A family of optimal locally recoverable codes, " 2013. [Online]. Available: ArXiv:1311.3284.
7. N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, "Optimal linear codes with a local-error-correction property, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, Jul. 2012, pp. 2776-2780.
8. L. Pamies-Juarez, H. D. L. Hollmann, and F. Oggier, "Locally repairable codes with multiple repair alternatives, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2013, pp. 892-896.
9. A. Wang and Z. Zhang, "Repair locality with multiple erasure tolerance, " CoRR, vol. abs/1306.4774, 2013.
10. N. Silberstein, A. S. Rawat, and S. Vishwanath, "Error resilience in distributed storage via rank-metric codes, " in Proc. 50th Annual Allerton Conf. on Communication, Control, and Computing (Allerton), Urbana- Champaign, IL, Oct. 2012, pp. 1150 -1157.
11. I. Tamo, D. S. Papailiopoulos, and A. G. Dimakis, "Optimal locally repairable codes and connections to matroid theory, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2013, pp. 1814-1818.
12. G. M. Kamath, N. Prakash, V. Lalitha, and P. V. Kumar, "Codes with local regeneration, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2013, pp. 1606-1610.
13. N. Silberstein, A. S. Rawat, O. O. Koyluoglu, and S. Vishwanath, "Optimal locally repairable codes via rank-metric codes, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2013, pp. 1819-1823.
14. G. M. Kamath, N. Silberstein, N. Prakash, A. S. Rawat, V. Lalitha, O. O. Koyluoglu, P. V. Kumar, and S. Vishwanath, "Explicit mbr all-symbol locality codes, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2013, pp. 504-508.
15. M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur, "Xoring elephants: Novel erasure codes for big data, " 2013. [Online]. Available: ArXiv:1301.3791.
16. N. Prakash, V. Lalitha, and P. V. Kumar, "Codes with locality for two erasures, " 2014. [Online]. Available: ArXiv:1401.2422.
17. V. K. Wei, "Generalized Hamming weights for linear codes, " IEEE Trans. Inf. Theory, vol. 37, no. 5, pp. 1412-1418, 1991.
18. T. Helleseth, T. Klove, V.I. Levenshtein, and O. Ytrehus, "Bounds on the minimum support weights, " IEEE Trans. Inf. Theory, vol. 41, no. 2, pp. 432-440, 1995.
19. R. Diestel, Graph Theory. Springer Verlag, 2005.