Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems

2011 ◽  
Author(s):  
Viveck R. Cadambe ◽  
Cheng Huang ◽  
Jin Li
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Mds Code ◽  
Permutation Code ◽  
Distributed Storage Systems ◽  
Exact Repair ◽  
Failed Node

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.

Sign in / Sign up

Export Citation Format

Share Document