Long MDS codes for optimal repair bandwidth

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1182-1186

  Wang, Zhiying ^a   Tamo, Itzhak ^a,b   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

2D ARRAYS; ARRAY CODES; CODE CONSTRUCTION; CODE LENGTH; HIGH RATE; INFORMATION NEED; MDS CODE; STORAGE SYSTEMS;

BANDWIDTH; DIGITAL STORAGE; INFORMATION THEORY; OPTIMIZATION; REPAIR;

OPTIMAL SYSTEMS;

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

References (16)

1. 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.
2. V. R. Cadambe, C. Huang, S. A. Jafar, and J. Li, "Optimal repair of MDS codes in distributed storage via subspace interference alignment", Tech. Rep. arXiv:1106.1250, 2011.
3. V. R. Cadambe, C. Huang, J. Li, and S. Mehrotra," Polynomial length MDS codes with optimal repair in distributed storage systems", in Proceedings of 45th Asilomar Conference on Signals Systems and Computing, Nov 2011.
4. V. R. Cadambe, S. A. Jafar, and H. Maleki, "Minimum repair bandwidth for exact regeneration in distributed storage," in Wireless Network Coding Conference (WiNC), Jun 2010.
5. 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.
6. D. S. Papailiopoulos, and A.G. Dimakis, "Distributed storage codes through Hadamard designs, " in ISIT, 2011.
7. D. S. Papailiopoulos, A.G. Dimakis, and V. R. Cadambe, " Repair Optimal Erasure Codes through Hadamard Designs," in Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, 2011.
8. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage," in Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, 2009.
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. C. Suh and K. Ramchandran, "Exact-Repair MDS Code Construction Using Interference Alignment," IEEE Trans. on Information Theory, vol 57, no. 3, pp. 1425-1442, 2011.
11. C. Suh and K. Ramchandran, "On the existence of optimal exact-repair MDS codes for distributed storage," Tech. Rep. arXiv:1004.4663, 2010.
12. I. Tamo, Z. Wang, and J. Bruck, "MDS array codes with optimal rebuilding," in ISIT, 2011.
13. I. Tamo, Z. Wang, and J. Bruck, "Zigzag codes: MDS array codes with optimal rebuilding," Tech. Rep. arXiv:1112.0371, 2011.
14. I. Tamo, Z. Wang, and J. Bruck, "Access vs. bandwidth in codes for storage," accepted by ISIT, 2012.
15. Z. Wang, I. Tamo, and J. Bruck, " On codes for optimal rebuilding access," in Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, 2011.
16. Z. Wang, I. Tamo, and J. Bruck, "Long MDS codes for optimal repair bandwidth", Tech. Rep. Available at http://paradise.caltech.edu/etr.html.