Update efficient codes for distributed storage

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 1457-1461

  Rawat, Ankit Singh ^a   Vishwanath, Sriram ^a   Bhowmick, Abhishek ^b   Soljanin, Emina ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b University of Texas at Austin   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA CHANGE; DISTRIBUTED STORAGE; ENCODING PROCESS; EXACT RECONSTRUCTION; MINIMUM INFORMATION; SPARSITY CONSTRAINTS; STORAGE NODES;

EFFICIENCY; INFORMATION THEORY;

REPAIR;

EID: 80054827530     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033782     Document Type: Conference Paper

References (13)

1. A. G. Dimakis, P. Godfrey, M. Wainwright, and K. Ramachandran, "Network coding for distributed storage system", in Proc. of IEEE INFOCOM, pp. 2000-2008, May 2007.
2. Y. Wu, A. G. Dimakis and K. Ramchandran, "Deterministic regenerating codes for distributed storage", 45th Allerton Conference on Control, Computing and Communication, Sep. 2007.
3. Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage", IEEE JSAC, vol. 28, pp. 277-288, Feb. 2010.
4. Y. Wu and A. G. Dimakis, "Reducing repair traffic for erasure codingbased storage via interference alignment", in Proc. of IEEE ISIT, pp. 1150-1154, July 2009.
5. N. Shah, K. Rashmi, P. Kumar and K. Ramchandran, "Explicit codes minimizing repair bandwidth for distributed storage", in Proc. of IEEE ITW, Jan 2010.
6. C. Suh and K. Ramchandran, "Exact-repair MDS codes for distributed storage using interference alignment", in Proc. of IEEE ISIT, 2010.
7. V. Cadambe, S. Jafar and H. Maleki, "Minimum repair bandwidth for exact regeneration in distributed storage", IEEE WiNC, June 2010.
8. C. Suh and K. Ramchandran, "On the existence of optimal exact-repair MDS codes for distributed storage", CoRR, vol. abs/1004.4663, 2010, http://arxiv.org/abs/1004.4663.
9. N. Anthapadmanabhan, E. Soljanin and S. Vishwanath, "Update- efficient codes for erasure correction", 48th Annual Allerton Conference on Communication, Control, and Computing, 2010.
10. L. Xu and J. Bruck, "X-code: MDS array codes with optimal encoding", IEEE Tran. Information Theory, vol. 45, pp. 272-276, 1999.
11. L. Xu, V. Bohossian and J. Bruck, "Low density MDS codes and factors of complete graphs", IEEE Tran. Information Theory, vol. 45, pp. 1817-1826, 1999.
12. V. F. Kolchin, Random graphs, ser. Encyclopedia of Mathematics and its Applications, G.-C. Rota, Ed. Cambridge University Press, 1999.
13. J. Blömer, R. Karp and E. Welzl, "The rank of sparse random matrices over finite fields", in Random Struct. Algorithms, John Wiley & Sons, Inc., 1997.