Explicit construction of minimum bandwidth rack-aware regenerating codes  

作　　者：Liyang ZHOU Zhifang ZHANG 

机构地区：[1]Key Laboratory of Mathematics Mechanization,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,China [2]School of Mathematical Sciences,University of Chinese Academy of Sciences,Beijing 100049,China

出　　处：《Science China(Information Sciences)》2022年第7期263-264,共2页中国科学（信息科学）（英文版）

基　　金：supported in part by National Key R&D Program of China (Grant No.2020YFA0712300);National Natural Science Foundation of China (Grant No. 61872353)。

摘　　要：Dear editor, Erasure codes are increasingly adopted in modern storage systems (such as Windows Azure Storage [1] and Facebook storage [2]) to ensure fault-tolerant storage with low redundancy. Meanwhile, efficient repair of node failures becomes a central issue in coding for distributed storage. The repair efficiency is usually measured by the repair bandwidth which is the amount of data transmitted from the helper nodes during the repair process.

关 键 词：EDITOR repair FAULT 

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