Exact-repair MDS code construction using interference alignment

IEEE Transactions on Information Theory

Volumn 57, Issue 3, 2011, Pages 1425-1442

  Suh, Changho ^a   Ramchandran, Kannan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distributed storage; exact repair MDS codes; interference alignment; network codes

Indexed keywords

DISTRIBUTED STORAGE; EXACT-REPAIR MDS CODES; FAILED NODES; FIELD SIZE; INTERFERENCE ALIGNMENT; MAXIMUM DISTANCE SEPARABLE ERASURE CODES; MDS CODE; NETWORK CODES; REPAIR COSTS;

ALIGNMENT;

REPAIR;

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

References (19)

1. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in Proc. IEEE INFOCOM, Anchorage, AK, May 2007.
2. Y. Wu, A. G. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage," in Proc. Allerton Conf. Control, Computing and Communication, Sep. 2007.
3. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 1204-1216, Jul. 2000.
4. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
5. T. Ho, R. Koetter, M. Médard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
6. S. Pawar, S. ElRouayheb, and K. Ramchandran, "On secure distributed data storage under repair dynamics," in Proc. IEEE Int. Symp. Information Theory, Austin, TX, Jun. 2010.
7. R. W. Yeung, Information Theory and Network Coding. New York: Springer, 2008.
8. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear network codes," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
9. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Explicit codes minimizing repair bandwidth for distributed storage," in Proc. IEEE Information Theory Workshop, Cairo, Egypt, Jan. 2010.
10. D. Cullina, A. G. Dimakis, and T. Ho, "Searching for minimum storage regenerating codes," in Proc. Allerton Conf. Control, Computing and Communication, Sep. 2009.
11. M. A. Maddah-Ali, S. A. Motahari, and A. K. Khandani, "Communication over MIMO X channels: Interference alignment, decomposition, and performance analysis," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3457-3470, Aug. 2008.
12. V. R. Cadambe and S. A. Jafar, "Interference alignment and the degree of freedom for the K user interference channel," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3425-3441, Aug. 2008.
13. C. Suh and D. Tse, "Interference alignment for cellular networks," in Proc. Allerton Conf. Control, Computing and Communication, Sep. 2008.
14. Y.Wu and A. G. Dimakis, "Reducing repair traffic for erasure codingbased storage via interference alignment," in Proc. IEEE Int. Symp. Information Theory, Seoul, Korea, Jul. 2009.
15. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Explicit construction of optimal exact regenerating codes for distributed storage," in Proc. Allerton Conf. Control, Computing and Communication, Sep. 2009.
16. Y.Wu, "A construction of systematic MDScodes with minimum repair bandwidth," in arXiv:0910.2486, Oct. 2009.
17. A. S. Householder, The Theory of Matrices in Numerical Analysis. Toronto, Canada: Dover, 1974.
18. A. A. Bubrulle, Work Notes on Elementary Matrices Hewlett-Packard Laboratory, 1993, Tech. Rep. HPL-93-69.
19. D. S. Bernstein, Matrix Mathematics: Theory, Facts, and Formulas With Application to Linear Systems Theory. Princeton, NJ: Princeton Univ. Press, 2005.