Reducing repair traffic for erasure coding-based storage via interference alignment

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2276-2280

  Wu, Yunnan ^a   Dimakis, Alexandros G ^b  

^a MICROSOFT RESEARCH   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFECTIVE DIMENSIONS; ERASURE CODING; INTERFERENCE ALIGNMENT; MDS CODE; NETWORK TRAFFIC; SINGLE NODE FAILURE; STORAGE SYSTEMS;

ALIGNMENT; INTERNET;

INFORMATION THEORY;

EID: 70449469445     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205898     Document Type: Conference Paper

References (5)

1. V. R. Cadambe and S. A. Jafar, "Interference alignment and the degrees of freedom for the K user interference channel," IEEE Transactions on Information Theory, 54(8), pp. 3425-3441, Aug. 2008.
2. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran. "Network coding for distributed storage systems," Submitted for journal publication. Preliminary version appeared in Infocom 2007.
3. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
4. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
5. Y. Wu, A. G. Dimakis, and K. Ramchandran. "Deterministic regenerating codes for distributed storage," In Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, September 2007.