- ISSN 0258-2724
- CN 51-1277/U
- EI Compendex
- Scopus
- Indexed by Core Journals of China, Chinese S&T Journal Citation Reports
- Chinese S&T Journal Citation Reports
- Chinese Science Citation Database
| Citation: | ZHANG Sina, TANG Xiaohu, LI Jie. A New (k+2, k) Hadamard Minimum Storage Regenerating Code[J]. Journal of Southwest Jiaotong University, 2016, 29(1): 188-192,200. doi: 10.3969/j.issn.0258-2724.2016.01.026
|
|
RHEA S, WELLS C, EATON P, et al. Maintenance-free global data storage[J]. IEEE Internet Computing, 2001, 5(5): 40-49.
|
|
BHAGWAN R, TATI K, CHENG Y C, et al. Total recall: System support for automated availability management[C]//Symposium Networked Systems Design and Implementation. San Francisco: ACM, 2004: 25-25.
|
|
DABEK F, LI Jinyang, SIT E, et al. Designing a DHT for low latency and high throughput[C]//Symposium Networked Systems Design and Implementation (NSDI). San Francisco: ACM, 2004: 85-98
|
|
HUANG Cheng, SIMITCI H, XU Yi, et al. Erasure coding in windows azure storage[C]//Usenix annual Technical Conference. Boston: ACM, 2012: 15-26.
|
|
DIMAKIS A G, GODFREY P B, WU Yunnan, et al. Network coding for distributed storage systems[J]. IEEE Transactions on Information Theory, 2010, 56(9): 4539-4551.
|
|
范文礼,刘志刚. 基于传输效率矩阵的复杂网络节点重要度排序方法[J]. 西南交通大学学报,2014,49(2): 337-342. FAN Wenli, LIU Zhigang. Ranking method for node importance based on efficiency matrix[J]. Journal of Southwest Jiaotong University, 2014, 49(2): 337-342.
|
|
DIMAKIS A G, RAMCHANDRAN K, WU Yunnan, et al. A survey on network codes for distributed storage[J]. Proceedings of the IEEE, 2011, 99(3): 476-489.
|
|
郝杰,逯彦博,刘鑫吉,等. 分布式存储中的再生码综述[J]. 重庆邮电大学学报:自然科学版,2013,25(1): 30-38. HAO Jie, LU Yanbo, LIU Xinji, et al. Survey for regenerating codes for distributed storage[J]. Journal of Chongqing University of Posts and Telecommunications: Natural Science Edition, 2013, 25(1): 30-38.
|
|
PAPAILIOPOULOS D S, DIMAKIS A G, CADAMBE V R. Repair optimal erasure codes through hadamard designs[J]. IEEE Transactions on Information Theory, 2013, 59(5): 3021-3037.
|
|
TAMO I, WANG Zhiying, BRUCK J. Zigzag codes: MDS array codes with optimal rebuilding[J]. IEEE Transactions on Information Theory, 2013, 59(3): 1597-1616.
|
|
WANG Zhiying, TAMO I, BRUCK J. Long MDS codes for optimal repair bandwidth[C]//Proceedings of IEEE International Symposium on Information Theory. Cambridge: IEEE, 2012: 1182-1186.
|
|
TAMO I, WANG Zhiying, BRUCK J. MDS array codes with optimal rebuilding[C]//Proceedings of IEEE International Symposium on Information Theory. St. Petersburg: IEEE, 2011: 1240-1244.
|
|
CADAMBE V R, JAFAR S A, MALEKI H, et al. Asymptotic interference alignment for optimal repair of MDS codes in distributed storage[J]. IEEE Transactions on Information Theory, 2013, 59(5): 2974-2987.
|
|
CADAMBE V R, HUANG Cheng, LI Jin, et al. Polynomial length MDS codes with optimal repair in distributed storage[C]//The 45th Asilomar Conference on Signals, Systems and Computers (ASILOMAR).Pacific Grove: IEEE, 2011: 1850-1854.
|
|
CADAMBE V R, HUANG Cheng, LI Jin. Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems[C]//Proceedings of IEEE International Symposium on Information Theory Proceedings (ISIT).St. Petersburg: IEEE, 2011: 1225-1229.
|
|
TAMO I, WANG Zhiying, BRUCK J. Access versus bandwidth in codes for storage[J]. IEEE Transactions on Information Theory, 2014, 60(4): 2028-2037.
|
YU Kunlong, WANG Weihua, HUANG Hanjie, FANZhenzhong. Investigations of Wind Loads on a New Type of Self-Supporting Four Pipe Steel Chimney[J]. Journal of Southwest Jiaotong University, 2011, 24(3): 421-426. doi: 10.3969/j.issn.0258-2724.2011.03.011
DownLoad: