Construction of Minimum Bandwidth Regenerating Codes with Combinatorial Design  

作　　者：CAI Feng GUO Wangmei 

机构地区：[1]State Key Laboratory of Integrated Services Networks,Xidian University

出　　处：《Wuhan University Journal of Natural Sciences》2016年第3期229-234,共6页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China(61271174,61301178)

摘　　要：We study the construction of minimum bandwidth regenerating code with combinatorial design. At first, a method of constructing minimum storage regenerating （MBR） codes is presented, which can tolerate only one-node failure. Then, we give examples to explain the code. Finally, we discuss the case of repairing multiple nodes, and analyze the performance with an example.We study the construction of minimum bandwidth regenerating code with combinatorial design. At first, a method of constructing minimum storage regenerating （MBR） codes is presented, which can tolerate only one-node failure. Then, we give examples to explain the code. Finally, we discuss the case of repairing multiple nodes, and analyze the performance with an example.

关 键 词：distributed storage system minimum bandwidth regenerating codes combinatorial design network coding 

分 类 号：TP911.2[自动化与计算机技术]