一类精确修复多个错误的Suh-Ramchandran码  

Class of Suh-Ramchandran codes with exact multi-failure repair

作　　者：王丽莎[1] 唐小虎[1] 荣磊[1] 

机构地区：[1]西南交通大学信息科学与技术学院,成都611756

出　　处：《计算机应用研究》2017年第6期1778-1782,共5页Application Research of Computers

基　　金：博士点基金优先发展领域课题资助项目(20120184130002);国家"863"计划5G二期资助项目(2015AA01A710)

摘　　要：再生码因能有效地减少修复带宽,更适用于分布式存储系统。利用干扰对齐技术,对于任意的参数(n,k,d),满足n≥2k且d≥2k-1。Suh和Ramchandran构造了修复一个失效节点时,可达到最优修复带宽的最小存储再生码。基于Suh-Ramchandran再生码,重新描述了参数(n=2k+1;k)下的编码结构,并说明这种码为一类可修复多个失效节点的再生码,且在修复单个或多个失效节点时均可达到最优的修复带宽。Regenerating codes are more suitable for distributed storage system since it can effectively reduce the repair band- width. By using the interference alignment technique, Suh-Ramchandran constructed a class of minimum storage regene-rating codes, which could repair a single failure node with optimal repair bandwidth for any parameters （n,k,d）such that n≥2k and d≥2k - 1. This paper redescribed a class of codes with parameters （ n = 2k ＋ 1 ;k） based on Suh-Ramchandran regenerating codes, and shows that the constructed minimum storage regenerating codes could achieve optimal repair bandwidth for either single or multiple nodes failure repair.

关 键 词：分布式存储 干扰对齐 Suh—Ramchandran再生码 最小存储再生码 最小存储合作再生码 

分 类 号：TP302.8[自动化与计算机技术—计算机系统结构]