计算机应用研究2017，Vol.34Issue(6)：1778-1782,5.DOI:10.3969/j.issn.1001-3695.2017.06.039
一类精确修复多个错误的Suh-Ramchandran码
Class of Suh-Ramchandran codes with exact multi-failure repair
摘要
Abstract
Regenerating codes are more suitable for distributed storage system since it can effectively reduce the repair bandwidth.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再生码/最小存储再生码/最小存储合作再生码Key words
distributed storage/interference alignment/Suh-Ramchandran regeneration code/minimum storage regenerating codes/minimum storage cooperative regenerating codes分类
信息技术与安全科学引用本文复制引用
王丽莎,唐小虎,荣磊..一类精确修复多个错误的Suh-Ramchandran码[J].计算机应用研究,2017,34(6):1778-1782,5.基金项目
博士点基金优先发展领域课题资助项目(20120184130002) （20120184130002）
国家“863”计划5G二期资助项目(2015AA01A710) （2015AA01A710）
