Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups
نویسندگان
چکیده
منابع مشابه
Optimal binary linear locally repairable codes with disjoint repair groups
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However, most known constructions are over large fields with sizes close to the code length, which lead to the systems computationally expensive. Due to this, binary...
متن کاملLinear Locally Repairable Codes with Random Matrices
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this gives also a constructive method to find...
متن کاملOptimal locally repairable codes via elliptic curves
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg [14] first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, q-ary optimal locally repairable codes from subcodes of Reed-Solomon codes giv...
متن کاملLocally Repairable Codes with Functional Repair and Multiple Erasure Tolerance
We consider the problem of designing [n, k] linear codes for distributed storage systems (DSS) that satisfy the following (r, t)-local repair property: (r, t)-Local Repair Property: Any t′(≤ t) simultaneously failed nodes can be locally repaired, each with locality r. The parameters n, k, r, t are positive integers such that r < k < n and t ≤ n−k. We consider the functional repair model and the...
متن کاملOptimal Locally Repairable Codes with Improved Update Complexity
For a systematic erasure code, update complexity (UC) is defined as the maximum number of parity blocks needed to be changed when some information blocks are updated. Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems. In this paper, update complexity of optimal LRCs is studied and both lower and upper bounds on UC are established in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2019
ISSN: 0895-4801,1095-7146
DOI: 10.1137/19m1248443