A flexible class of regenerating codes for distributed storage
暂无分享,去创建一个
[1] Alexandros G. Dimakis,et al. Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[2] Kannan Ramchandran,et al. Explicit codes uniformly reducing repair bandwidth in distributed storage , 2010, 2010 National Conference On Communications (NCC).
[3] Pablo Rodriguez,et al. Dynamic parallel access to replicated content in the internet , 2002, TNET.
[4] A. Dimakis,et al. Deterministic Regenerating Codes for Distributed Storage Yunnan , 2007 .
[5] Yunnan Wu,et al. Reducing repair traffic for erasure coding-based storage via interference alignment , 2009, 2009 IEEE International Symposium on Information Theory.
[6] Kannan Ramchandran,et al. Explicit construction of optimal exact regenerating codes for distributed storage , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[7] Kannan Ramchandran,et al. Explicit codes minimizing repair bandwidth for distributed storage , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).
[8] Xu Zhou,et al. A speed-based adaptive dynamic parallel downloading technique , 2005, OPSR.
[9] Alexandros G. Dimakis,et al. Searching for Minimum Storage Regenerating Codes , 2009, ArXiv.