[1] Ahlswede R, Cai Ning. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1206. [2] Dimakis A, Godfrey P, Wu Yunnan. Network coding for distributed storage systems [J]. IEEE Transactions on Information Theory, 2010, 56(9): 4539-4551. [3] Cadambe V, Jafar S, Maleki H. Minimum repair bandwidth for exact regeneration in distributed storage //2010 3rd IEEE International Workshop on Wireless Network Coding. Boston: IEEE, 2010: 1-6. [4] Rashmi K, Shah N, Kumar P. Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage//2010 IEEE International Symposium on Information Theory Proceedings. Austin: IEEE, 2010: 1938-1942. [5] Changho S, Ramchandran K. Exact-repair MDS code construction using interference alignment[J]. IEEE Transactions on Information Theory, 2011, 57(3): 1425-1442. [6] Wu Yunnan. A construction of systematic MDS codes with minimum repair bandwidth[J]. IEEE Transactions on Information Theory, 2011, 57(6): 3738-3741. [7] Rashmi K, Shah N, Kumar P. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction [J]. IEEE Transactions on Information Theory, 2011, 57(8): 5227-5239. [8] Gharaibeh A, Al S, Ripeanu M. Thriftstore: finessing reliability trade-offs in replicated storage systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2011, 22(6): 910-923. [9] Mitra J. Reliability-based sizing of backup storage[J]. IEEE Transactions on Power Systems, 2010, 25(2): 1198-1199. [10] Shah N, Rashmi K, Vijay K. Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff [J]. IEEE Transactions on Information Theory, 2012, 58(3): 1837-1852.
|