[1] DIMAKIS A G,GODFREY P B,WU Y,et al.Network coding for distributed storage systems[J].IEEE Trans Inf Theory,2010,56(9): 4539-4551. [2] DIMAKIS A G,RAMCHANDRAN K,WU Y,et al.A survey on network codes for distributed storage[J].Proc IEEE,2011,99(3): 476-489. [3] GURUSWAMI V,WOOTTERS M.Repairing Reed-Solomon codes[J].IEEE Trans Inf Theory,2016,63(9): 5684-5698. [4] DAU H,DUURSMA I,KIAH H M,et al.Repairing Reed-Solomon codes with multiple erasures[DB/OL].[2018-09-01]. https://arxiv.org/abs/1612.01361. [5] DAU H,DUURSMA I,KIAH H M,et al.Repairing Reed-Solomon codes with two erasures[DB/OL].[2018-09-01].https://arxiv.org/abs/1701.07118. [6] CADAMBE V R,HUANG C,LI J.Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems[C]// 2011 IEEE International Symposium on Information Theory Proceedings.IEEE,2011: 1225-1229. [7] GOPPAV D.Codes on algebraic curves[J].Dokl Akad Nauk SSSR,1981,24(1): 170-172.(in Russian) [8] STICHTENOTH H.Algebraic Function Fields and Codes[M].Berlin: Springer,1993. [9] LI J,TANG X,TIAN C.Enabling all-node-repair in minimum storage regenerating codes[DB/OL].[2018-09-01].https://arxiv.org/abs/1604.07671. [10] JIN L,LUO Y,XING C.Repairing algebraic geometry codes[J].IEEE Trans Inf Theory,2018,64(2): 900-908. [11] LIDL R,NIEDERREITER H.Finite Fields[M].Cambridge: Cambridge University Press,2003. [12] MARDIA J,BARTANY B,WOOTTERS M.Repairing multiple failures for scalar MDS codes[DB/OL].[2018-09-01]. https://arxiv.org/abs/1707.02241.
() () |