密码学报2018，Vol.5Issue(2)：151-166,16.DOI:10.13868/j.cnki.jcr.000227
具有3或4位全局校验的SD码和PMDS码的构造
New Constructions of SD Codes and PMDS Codes with Three or Four Global Parities
摘要
Abstract
Erasure codes used in storage systems are designed to tolerate the failures of entire disks. However,the most common type of failures is the mode of disk failures accompanied by sector failures. Blaum et al. proposed SD codes and PMDS codes for this kind of general failures. SD codes and PMDS codes consume far less storage resources than traditional erasure codes used in RAID storage structure. It has been an open problem for some years to construct SD codes and PMDS codes with good fault tolerance capability. The constructions of SD codes and PMDS codes are mainly based on parity check matrices or generator matrices. However,the local parity number m and the global parity number s are limited. In known constructions of SD codes and PMDS codes based on parity check matrices, if the global parity number s = 3 or 4, the local parity number m has to satisfy m 6 2; if the local parity number m ≥ 1, the global parity number s has to satisfy s 6 2. In this paper, we present a new construction of SD codes and PMDS codes based on parity check matrices with m≥1 and s=3, which means better fault tolerance capability. For SD codes, so far the best construction based on generator matrices has parameters up to m≥1 and s=3. In this paper, we present a new construction of SD codes with m≥1 and s=4.关键词
磁盘阵列/RAID/SD码/PMDS码/纠删码Key words
disk array/RAID/SD code/PMDS code/erasure code分类
信息技术与安全科学引用本文复制引用
荣幸,杨小龙,胡红钢..具有3或4位全局校验的SD码和PMDS码的构造[J].密码学报,2018,5(2):151-166,16.基金项目
国家自然科学基金项目(61522210,61632013)National Natural Science Foundation of China(61522210,61632013) （61522210,61632013）
