短码长二元循环码的局部修复度
发布时间：2018-11-15 23:29
【摘要】：局部修复码是一种局部纠删编码,近年来在分布式存储系统中得到了广泛的应用。码的局部修复度为r指的是,码字的任一位发生删除错误时至多需要该码字的其他r位进行恢复。研究了r≤3的二元循环局部修复码的存在性与构造。基于循环码定义集理论,采用局部修复码的对偶码描述,依据码的参数制约关系,进行局部修复码的构造及参数优化。证明了r=1的任意码长二元循环码的存在性,构造了r=1且参数达到Griesmer界的局部修复码;给出了r=2和r=3的部分码长二元循环码存在性的判据,基于7≤n≤99的二元循环码分别构造了r=2和r=3的、参数优良的短码长局部修复码。研究结果对进一步研究循环码的局部修复度与其他参数的关系、构造参数优良的一般码长局部修复码具有借鉴作用。
[Abstract]:Local repair code is a kind of local erasure code, which has been widely used in distributed storage systems in recent years. The local repair degree of code is r which means that at most the other r bits of a codeword need to be recovered if any bit of the codeword has a deletion error. The existence and construction of binary cyclic local repair codes with r 鈮，
本文编号：2334719
[Abstract]:Local repair code is a kind of local erasure code, which has been widely used in distributed storage systems in recent years. The local repair degree of code is r which means that at most the other r bits of a codeword need to be recovered if any bit of the codeword has a deletion error. The existence and construction of binary cyclic local repair codes with r 鈮，
本文编号：2334719
本文链接：https://www.wllwen.com/kejilunwen/yysx/2334719.html
