scholarly journals Overview of Binary Locally Repairable Codes for Distributed Storage Systems

Electronics ◽  
2019 ◽  
Vol 8 (6) ◽  
pp. 596 ◽  
Author(s):  
Young-Sik Kim ◽  
Chanki Kim ◽  
Jong-Seon No
Keyword(s):  
Code Generation ◽  
Hardware Implementation ◽  
Linear Codes ◽  
Cyclic Code ◽  
Storage Systems ◽  
Distributed Storage ◽  
Partial Spread ◽  
Hamming Code ◽  
Distributed Storage Systems ◽  
Locally Repairable Codes

This paper summarizes the details of recently proposed binary locally repairable codes (BLRCs) and their features. The construction of codes over a small alphabet size of symbols is of particular interest for efficient hardware implementation. Therefore, BLRCs are highly noteworthy because no multiplication is required during the encoding, decoding, and repair processes. We explain the various construction approaches of BLRCs such as cyclic code based, bipartite graph based, anticode based, partial spread based, and generalized Hamming code based techniques. We also describe code generation methods based on modifications for linear codes such as extending, shorting, expurgating, and augmenting. Finally, we summarize and compare the parameters of the discussed constructions.

scholarly journals Priority Random Linear Codes in Distributed Storage Systems

2009 ◽  
Vol 20 (11) ◽  
pp. 1653-1667 ◽  
Author(s):  
Yunfeng Lin ◽  
Ben Liang ◽  
Baochun Li
Keyword(s):  
Linear Codes ◽  
Storage Systems ◽  
Distributed Storage ◽  
Distributed Storage Systems

Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields

2020 ◽  
Vol 31 (03) ◽  
pp. 327-339
Author(s):  
Gang Wang ◽  
Min-Yao Niu ◽  
Fang-Wei Fu
Keyword(s):  
Finite Fields ◽  
Linear Codes ◽  
Distributed Storage ◽  
Symplectic Space ◽  
Information Rate ◽  
Local Repair ◽  
Distributed Storage Systems ◽  
Isotropic Subspaces ◽  
Locally Repairable Codes ◽  
Totally Isotropic Subspaces

Linear code with locality [Formula: see text] and availability [Formula: see text] is that the value at each coordinate [Formula: see text] can be recovered from [Formula: see text] disjoint repairable sets each containing at most [Formula: see text] other coordinates. This property is particularly useful for codes in distributed storage systems because it permits local repair of failed nodes and parallel access of hot data. In this paper, two constructions of [Formula: see text]-locally repairable linear codes based on totally isotropic subspaces in symplectic space [Formula: see text] over finite fields [Formula: see text] are presented. Meanwhile, comparisons are made among the [Formula: see text]-locally repairable codes we construct, the direct product code in Refs. [8], [11] and the codes in Ref. [9] about the information rate [Formula: see text] and relative distance [Formula: see text].

Multiple Repair Localities with Distinct Erasure Tolerance

2016 ◽  
Vol 27 (06) ◽  
pp. 665-674
Author(s):  
Jiyong Lu ◽  
Jun Zhang ◽  
Xuan Guang ◽  
Fang-Wei Fu
Keyword(s):  
Lower Bound ◽  
Linear Code ◽  
Linear Codes ◽  
Storage Systems ◽  
Distributed Storage ◽  
Local Repair ◽  
Codeword Length ◽  
Information Set ◽  
Distributed Storage Systems ◽  
Failed Node

In distributed storage systems, codes with lower repair locality for each coordinate are much more desirable since they can reduce the disk I/O complexity for repairing a failed node. The ith coordinate of a linear code 𝒞 is said to have [Formula: see text] locality if there exist δi non-overlapping local repair sets of size no more than ri, where a local repair set of one coordinate is defined as the set of some other coordinates by which one can recover the value at this coordinate. In this paper, we consider linear codes with information [Formula: see text] locality, where there exists an information set I such that for each [Formula: see text], the ith coordinate has [Formula: see text] locality and [Formula: see text] and [Formula: see text]. We derive a lower bound on the codeword length n for any linear [n, k, d] code with information [Formula: see text] locality. Particularly, we indicate that some existing bounds can be deduced from our result by restrictions on parameters.

scholarly journals Locally Repairable Codes Based on Fractional Repetition Codes in Distributed Storage Systems

2018 ◽  
Author(s):  
Jing Wang ◽  
Tiantian Wang ◽  
Xiangyang Liu ◽  
Xuefei Zhang ◽  
Shuxia Wang
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Distributed Storage Systems ◽  
Locally Repairable Codes

Secure locally repairable codes for distributed storage systems

2013 ◽  
Author(s):  
Ankit Singh Rawat ◽  
O. Ozan Koyluoglu ◽  
Natalia Silberstein ◽  
Sriram Vishwanath
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Distributed Storage Systems ◽  
Locally Repairable Codes

An Application-Oriented Cache Allocation and Prefetching Method for Long-Running Applications in Distributed Storage Systems

2019 ◽  
Vol 28 (4) ◽  
pp. 773-780 ◽  
Author(s):  
Chang Guo ◽  
Ying Li ◽  
Hongzhi Liu ◽  
Zhonghai Wu
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Distributed Storage Systems ◽  
Cache Allocation

Analysis of a Stochastic Model of Replication in Large Distributed Storage Systems

2017 ◽  
Vol 45 (1) ◽  
pp. 51-51
Author(s):  
Wen Sun ◽  
Véronique Simon ◽  
Sébastien Monnet ◽  
Philippe Robert ◽  
Pierre Sens
Keyword(s):  
Stochastic Model ◽  
Storage Systems ◽  
Distributed Storage ◽  
Distributed Storage Systems

Optimal Node Selection for Data Regeneration in Heterogeneous Distributed Storage Systems

2015 ◽  
Author(s):  
Qingyuan Gong ◽  
Jiaqi Wang ◽  
Dongsheng Wei ◽  
Jin Wang ◽  
Xin Wang
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Node Selection ◽  
Optimal Node ◽  
Distributed Storage Systems ◽  
Selection For

scholarly journals A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems

2018 ◽  
Vol 64 (9) ◽  
pp. 6257-6267 ◽  
Author(s):  
Jie Li ◽  
Xiaohu Tang ◽  
Chao Tian
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Mds Codes ◽  
Distributed Storage Systems ◽  
Generic Transformation
Sign in / Sign up

Export Citation Format

Share Document