Repair optimal erasure codes through Hadamard designs

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Volumn , Issue , 2011, Pages 1382-1389

  Papailiopoulos, Dimitris S ^a   Dimakis, Alexandros G ^a   Cadambe, Viveck R ^b  

^a University of Southern California ^*  (United States)

^b University of California at Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED STORAGE SYSTEM; ERASURE CODES; ERASURE CODING; FILE SIZES; FINITE FIELDS; HADAMARD; HADAMARD MATRICES; HIGH RATE; INTERFERENCE ALIGNMENT; OPEN PROBLEMS; REPAIR STRATEGY; SINGLE NODE FAILURE; STORAGE NODES;

COMMUNICATION; MULTIPROCESSING SYSTEMS; OPTIMAL SYSTEMS; OPTIMIZATION; REPAIR;

CODES (SYMBOLS);

EID: 84856083898     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2011.6120328     Document Type: Conference Paper

References (23)

1. D. S. Papailiopoulos, A. G. Dimakis, and V. R. Cadambe, "Repair optimal erasure codes through Hadamard designs." Preprint available at http://arxiv.org/abs/1106.1634.
2. The Coding for Distributed Storage wiki http://tinyurl.com/storagecoding
3. A. G. Dimakis, P. G. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in IEEE Trans. on Inform. Theory, vol. 56, pp. 4539-4551, Sep. 2010.
4. A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A survey on network codes for distributed storage," in IEEE Proceedings, vol. 99, pp. 476-489, Mar. 2011.
5. S. Ghemawat, H. Gobioff, and S.-T. Leung "The Google file system,"in Proc. ACM Symp. on Op. Sys. Principles (SOSP), Oct., 2003.
6. O. Khan, R. Burns, J. Plank, and C. Huang, "In search of I/O-optimal recovery from disk failures," to appear in Hot Storage 2011, 3rd Workshop on Hot Topics in Storage and File Systems, Portland, OR, Jun., 2011.
7. H. Weatherspoon and J. D. Kubiatowicz, "Erasure coding vs. replication: a quantitiative comparison," in Proc. IPTPS, 2002.
8. V. R. Cadambe and S. A. Jafar, "Interference alignment and the degrees of freedom for the K user interference channel," IEEE Trans. on Inform. Theory, vol. 54, pp. 3425-3441, Aug. 2008.
9. V. R. Cadambe and S. A. Jafar, "Reflections on interference alignment and the degrees of freedom of the K user interference channel," IEEE Inform. Theory Soc. Newsletter, vol. 59, pp. 5-9 Dec. 2009.
10. Y. Wu and A. G. Dimakis, "Reducing repair traffic for erasure codingbased storage via interference alignment," in Proc. IEEE Int. Symp. on Information Theory (ISIT), Seoul, Korea, Jul. 2009.
11. K.V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran "Exact regenerating codes for distributed storage," In Allerton Conf. on Control, Comp., and Comm., Urbana-Champaign, IL, September 2009.
12. C. Suh and K. Ramchandran, "Exact regeneration codes for distributed storage repair using interference alignment," in Proc. 2010 IEEE Int. Symp. on Inform. Theory (ISIT), Seoul, Korea, Jun. 2010.
13. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Interference alignment in regenerating codes for distributed storage: necessity and code constructions," Sep. 2010. Preprint Available online at http://arxiv.org/abs/1005.1634.
14. Y. Wu. "A construction of systematic MDS codes with minimum repair bandwidth," Submitted to IEEE Transactions on Information Theory, Aug. 2009. Preprint available at http://arxiv.org/abs/0910.2486.
15. V. Cadambe, S. Jafar, and H. Maleki, "Distributed data storage with minimum storage regenerating codes - exact and functional repair are asymptotically equally efficient," in 2010 IEEE Intern. Workshop on Wireless Network Coding (WiNC), Apr 2010.
16. C. Suh and K. Ramchandran, "On the existence of optimal exact-repair MDS codes for distributed storage," Apr. 2010. Preprint available at http://arxiv.org/abs/1004.4663
17. K. 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," submitted to IEEE Transactions on Information Theory. Preprint available at at http://arxiv.org/pdf/1005.4178.
18. I. Tamo, Z. Wang, and J. Bruck "MDS array codes with optimal rebuilding," to appear in 2011 IEEE Symposium on Information Theory (ISIT). Preprint available at http://arxiv.org/abs/1103.3737
19. V. R. Cadambe, C. Huang and J. Li, "Permutation codes: optimal exact-repair of a single failed node in MDS code based distributed storage systems," to appear in 2011 IEEE Symposium on Information Theory (ISIT).
20. V. R. Cadambe, C. Huang, S. A. Jafar, and J. Li, "Optimal repair of MDS codes in distributed storage via subspace interference alignment. "Preprint available at http://arxiv.org/abs/1106.1250.
21. B. Nazer, S. A. Jafar, M. Gastpar, and S. Vishwanath, "Ergodic interference alignment," in Proc. 2009 IEEE Symposium on Information Theory (ISIT), pp.1769-1773, Jun. 2009
22. D. S. Papailioulos and A. G. Dimakis, "Distributed storage codes through Hadamard designs," to appear in ISIT, 2011.
23. G. Bresler and D. N. C. Tse, "3 User interference channel: Degrees of freedom as a function of channel diversity," 47th Allerton Conf. on Comm. Control and Comp., pp.265-271, Sep. 2009