本文選題：局部修復(fù)碼　切入點(diǎn)：最優(yōu)極小距離　出處：《中國(guó)科學(xué):數(shù)學(xué)》2017年11期 　論文類(lèi)型：期刊論文

【摘要】：局部修復(fù)碼是近幾年分布式存儲(chǔ)編碼領(lǐng)域一個(gè)非常熱門(mén)的研究方向.滿(mǎn)足局部修復(fù)性r即要求碼字的一位能夠被其他至多r位恢復(fù).這種性質(zhì)對(duì)于提高分布式存儲(chǔ)系統(tǒng)中失效節(jié)點(diǎn)的修復(fù)效率非常重要.本文主要考慮了域規(guī)模小于n時(shí)最優(yōu)局部修復(fù)碼的構(gòu)造.具體地,本文構(gòu)造了有限域F_q(q=r/(r+1)n_1)滿(mǎn)足所有位局部修復(fù)性r=2、d=6和d=r+1的最優(yōu)局部修復(fù)碼.
[Abstract]:Local repair code is a very popular research field in the field of distributed storage coding in recent years. One bit of code word that meets the requirement of local repair can be recovered by most other r bits. This property is useful for improving distributed storage. The repair efficiency of failure nodes in storage systems is very important. In this paper, the construction of the optimal local repair codes when the domain size is smaller than n is considered. In this paper, we construct the optimal local repair codes of FQ / Q / r / r ~ 1 / n _ 1) for all bits of local repair.
【作者單位】： 中國(guó)科學(xué)院數(shù)學(xué)與系統(tǒng)科學(xué)研究院;
【分類(lèi)號(hào)】：O157.4
，

本文編號(hào)：1605744