Locally repairable codes with strict availability from linear functions  

作　　者：Yu ZHANG Haibin KAN 

机构地区：[1]Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science,Fudan University [2]Fudan-Zhongan Joint Laboratory of Blockchain and Information Security,Shanghai Institute of Intelligent Electronics & Systems

出　　处：《Science China(Information Sciences)》2018年第10期261-263,共3页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China (Grant No. 61672166);the Plan of Shanghai Excellent Academic Leaders (Grant No. 16XD1400200);the Innovation Plan of Shanghai Science and Technology (Grant No. 16JC1402700)

摘　　要：Dear editor,In distributed storage systems, data is dividedinto small pieces and stored across a number ofnodes. Since node failures are inevitable, redun-dancy is necessary. During the long run, the re-dundancy needs to be replenished. Regenerat-ing codes were proposed to decrease repair band-width of distributed storage systems by accessingmore nodes and downloading less data from eachnode.Dear editor,In distributed storage systems, data is dividedinto small pieces and stored across a number ofnodes. Since node failures are inevitable, redun-dancy is necessary. During the long run, the re-dundancy needs to be replenished. Regenerat-ing codes were proposed to decrease repair band-width of distributed storage systems by accessingmore nodes and downloading less data from eachnode.

关 键 词：Locally repairable codes with strict availability from linear functions 

分 类 号：TP333[自动化与计算机技术—计算机系统结构] TP3[自动化与计算机技术—计算机科学与技术]