.png){kind=icon}
返回
Optimal Locally Repairable Codes for Parallel Reading
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2992188.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Locally repairable codes (LRCs) have important applications in distributed storage systems. In this paper, we study q-ary [n; k; d] LRCs with (r; t; delta)-information-locality, where each of the i-th (1 <= i <= k) information symbol is contained in t punctured subcodes with length <= r + delta - 1, minimum distance delta, and the i-th information symbol is the unique common code symbol of these t subcodes, furthermore, each subcode contains exactly delta - 1 parity symbols. Firstly, an upper bound on the minimum distance of such q-ary LRCs with (r; t; delta)-information-locality is given. Then, we propose a general construction framework of q-ary optimal LRCs with (r; t; delta)-information-locality and minimum distance d D t(delta - 1) + 1 where the required field size is just q >= r + delta-2 The proposed optimal LRCs can always repair a failed information node locally in case of at most t delta - 1 node failures. Moreover, multiple repair subcodes can support parallel readings of data, thus make the proposed codes attractive for distributed storage systems with hot data.
Keyword:
Locally repairable codes
erasure codes
Singleton-like bound
optimal LRCs
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Carrier recombination at silicon–silicon nitride interfaces fabricated by plasma-enhanced chemical vapor deposition通过等离子体增强化学气相沉积在硅-氮化硅界面上的载流子复合
.png){kind=icon}
PREAI
分享收藏分享收藏Unsymmetric bimetal(II) complexes: Synthesis, structures and catalytic behaviors toward ethylene
PREAI
分享收藏
Binuclear copper complexes of ligands providing three donors to each metal ion配体的双核铜配合物为每个金属离子提供三个供体
PREAI
分享收藏分享收藏
查看更多内容