Hadamard Minimum Storage Regenerating Code Revisited
暂无分享,去创建一个
Jie Li | Xiaohu Tang | Sina Zhang | Xiaohu Tang | Jie Li | Sina Zhang
[1] Jie Li,et al. New repair strategy of Hadamard minimum storage regenerating code for distributed storage system , 2013, 2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA).
[2] Ben Y. Zhao,et al. Maintenance-Free Global Data Storage , 2001, IEEE Internet Comput..
[3] Jie Li,et al. A Framework of Constructions of Minimal Storage Regenerating Codes With the Optimal Access/Update Property , 2013, IEEE Transactions on Information Theory.
[4] Yunnan Wu,et al. A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.
[5] Dimitris S. Papailiopoulos,et al. Repair Optimal Erasure Codes Through Hadamard Designs , 2011, IEEE Transactions on Information Theory.
[6] Jehoshua Bruck,et al. Long MDS codes for optimal repair bandwidth , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[7] Jehoshua Bruck,et al. Access Versus Bandwidth in Codes for Storage , 2014, IEEE Transactions on Information Theory.
[8] Jehoshua Bruck,et al. Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.
[9] Stefan Savage,et al. Total Recall: System Support for Automated Availability Management , 2004, NSDI.
[10] Robert Tappan Morris,et al. Designing a DHT for Low Latency and High Throughput , 2004, NSDI.
[11] Jie Li,et al. A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems , 2015, IEEE Transactions on Information Theory.
[12] Alexandros G. Dimakis,et al. Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[13] Cheng Huang,et al. Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.