Access vs. bandwidth in codes for storage

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1187-1191

  Tamo, Itzhak ^a,b   Wang, Zhiying ^a   Bruck, Jehoshua ^a  

^a California Institute of Technology   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC RATE; FAILED NODES; MAXIMUM DISTANCE SEPARABLE CODE; MDS CODE; NODE FAILURE; RECOVERY PROCESS; STORAGE SYSTEMS; TIGHT BOUND; UPPER BOUND;

BANDWIDTH; INFORMATION THEORY; OPTIMIZATION;

OPTIMAL SYSTEMS;

EID: 84867559996     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283042     Document Type: Conference Paper

References (19)

1. Viveck R. Cadambe, Cheng Huang, Jin Li, Sanjeev Mehrotra, "Polynomial Length MDS Codes with Optimal Repair in Distributed Storage Systems," Proceedings of 45th Asilomar Conference on Signals Systems and Computing, Nov 2011
2. V. R. Cadambe, C. Huang, and J. Li,"Permutation code: optimal exactrepair of a single failed node in MDS code based distributed storage systems," in ISIT, 2011.
3. Viveck R. Cadambe, Syed A. Jafar, Hamed Maleki, Kannan Ramchandran and Changho Suh, "Asymptotic Interference Alignment for Optimal Repair of MDS codes in Distributed Data Storage".
4. A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. on Information Theory, vol. 56, no. 9, pp. 4539-4551, 2010.
5. Dimitris S. Papailiopoulos, Alexandros G. Dimakis, "Distributed Storage Codes through Hadamard Designs," http://arxiv.org/abs/1106.1652.
6. Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Viveck R. Cadambe, "Repair Optimal Erasure Codes through Hadamard Designs," 2011 Allerton Conference on Communication, Control and Computing, Illinois, U.S.A., September 2011. http://arxiv.org/abs/1106.1634.
7. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, " Explicit construction of optimal exact regenerating codes for distributed storage," in AllertonAllerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, 2009.
8. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Enabling node repair in any erasure code for distributed storage," in ISIT, 2011.
9. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Interference alignment in regenerating codes for distributed storage: necessity and code constructions," IEEE Trans. on Information Theory, vol 56, no. 4, pp. 2134-2158, 2012.
10. N. B. Shah, K. V. Rashmi, P. V. Kumar, K. Ramchandran, "Distributed storage codes with repair-by-transfer and non-achievability of interior points on the storage-bandwidth tradeoff," Tech. Rep. arXiv:1011.2361v2, 2010.
11. C. Suh and K. Ramchandran, "Exact-repair MDS codes for distributed storage using interference alignment," in ISIT, 2010.
12. I. Tamo, Z. Wang, J. Bruck, "MDS array codes with optimal rebuilding," IEEE International Symposium on Information Theory Proceedings (ISIT), 2011.
13. I. Tamo, Z. Wang, J. Bruck, "Zigzag Codes: MDS Array Codes with Optimal Rebuilding," http://arxiv.org/abs/1112.0371.
14. I. Tamo, Z. Wang, J. Bruck, "Access Vs. Bandwidth in Codes for Storage," Available at http://paradise.caltech.edu/etr.html
15. Y. Wu, R. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage," in Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, 2007.
16. Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage," in ISIT, 2009.
17. Y. Wu and A. Dimakis, "Reducing repair traffic for erasure coding-based storage via interference alignment," in ISIT, 2009.
18. Z. Wang, I. Tamo, J. Bruck, "On Codes for Optimal Rebuilding Access," 2011 Allerton Conference on Communication, Control and Computing, Illinois, U.S.A., September 2011. http://arxiv.org/abs/1106.1250.
19. Z. Wang, I. Tamo, J. Bruck, "Long MDS Codes for Optimal Repair Bandwidth," submitted to ISIT 2012. Available at http://paradise.caltech. edu/etr.html