On the locality of codeword symbols

IEEE Transactions on Information Theory

Volumn 58, Issue 11, 2012, Pages 6925-6934

  Gopalan, Parikshit ^a   Huang, Cheng ^a   Simitci, Huseyin ^a   Yekhanin, Sergey ^a  

^a MICROSOFT   (United States)

Author keywords

Block codes; linear codes

Indexed keywords

CODE-WORDS; CODEWORD; DATA STORAGE APPLICATIONS; ERASURE CORRECTION; IN-DEPTH STUDY; INFORMATION SYMBOL; LINEAR CODES; MESSAGE LENGTH; MINIMUM DISTANCE; OPTIMAL CODES; PARAMETER SETTING; PARITY CHECK; TIGHT BOUND;

BLOCK CODES; COMMERCE; REDUNDANCY; STRUCTURAL OPTIMIZATION;

STORAGE ALLOCATION (COMPUTER);

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

References (18)

1. V. R. Cadambe, S. A. Jafar, and H. Maleki, Distributed data storage with minimum storage regenerating codes - Exact and functional repair are asymptotically equally efficient, 2010, arXiv: 1004.4299.
2. Y. Cassuto and J. Bruck, "Low-complexity array codes for random and clustered 4-erasures," IEEE Trans. Inf. Theory, vol. 58, no. 1, pp. 146-158, Jan. 2012.
3. M. Chen,C.Huang, and J. Li, "Onmaximally recoverable property for multi-protection group codes," in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 486-490.
4. A. G. Dimakis,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.
5. A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A survey on network codes for distributed storage," Proc. IEEE, vol. 99, no. 3, pp. 476-489, Mar. 2011.
6. K. Efremenko, "3-query locally decodable codes of subexponential length," in Proc. 41st ACM Symp. Theory Comput., 2009, pp. 39-44.
7. O. Farras, J. Marti-Farre, and C. Padro, "Ideal multipartite secret sharing schemes," in Proc. 26th Annu. Int. Conf. Theory Appl. Cryptograph. Techn., 2007, pp. 448-465.
8. 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. Netw. Comput. Appl., 2007, pp. 79-86.
9. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure coding in Windows Azure Storage," presented at the USENIX Annu. Tech. Conf., Boston, MA, 2012.
10. S. Jukna, Extremal Combinatorics. New York: Springer-Verlag, 2001.
11. J. Katz and L. Trevisan, "On the efficiency of local decoding procedures for error-correcting codes," in Proc. 32nd ACM Symp. Theory Comput., 2000, pp. 80-86.
12. S. Kopparty, S. Saraf, and S. Yekhanin, "High-rate codes with sublinear-time decoding," in Proc. 43rd ACM Symp. Theory Comput., 2011, pp. 167-176.
13. 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.
14. I. Tamo, Z. Wang, and J. Bruck, MDS array codes with optimal rebuilding 2011, arXiv: 1103.3737.
15. M. Tsfasman, S. Vladut, and D. Nogin, Algebraic Geometric Codes: Basic Notions. Providence, RI: Amer. Math. Soc., 2007.
16. Z.Wang, I. Tamo, and J. Bruck, On codes for optimal rebuilding access 2011, arXiv: 1107.1627.
17. S. Yekhanin, "Towards 3-query locally decodable codes of subexponential length," J. ACM, vol. 55, pp. 1-16, 2008.
18. S. Yekhanin, "Locally decodable codes," Found. Trends Theor. Comput. Sci., vol. 7, pp. 1-119, 2011.