Results 11 to 20 of about 2,942 (253)
Optimal Locally Repairable Codes Via Elliptic Curves [PDF]
IEEE Transactions on Information Theory, 2019 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 \cite{TB14} first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes.
Xudong Li, Liming Ma, Chaoping Xing
openaire +5 more sources
Stripe Matching and Merging Algorithm-based Redundancy Transition for Locally Repairable Codes [PDF]
Jisuanji kexue, 2023 Compared with traditional replication technique,erasure coding is another data redundancy mechanism with lower space overhead at the cost of high repair cost.Locally repairable code is a special kind of erasure code with low repair cost,which is widely ...
DU Qingpeng, XU Yinlong, WU Si
doaj +1 more source
Locally Repairable Codes Based on Permutation Cubes and Latin Squares
IEEE Access, 2022 The importance of Locally Repairable Codes (LRCs) lies on their applications in distributed storage systems (DSSs). There are two approaches to repair multiple failed nodes: the parallel approach, in which a set of failed nodes are simultaneously ...
Ehsan Yavari +2 more
doaj +1 more source
Constructions of Binary Locally Repairable Codes With Multiple Recovering Sets
IEEE Access, 2021 Locally repairable codes (LRCs) with multiple recovering sets are highly demanded in distributed storage systems. In this letter, we generalize the construction of WZL code proposed by Wang et al.
Jiaming Teng, Lingfei Jin
doaj +1 more source
New Design and Analysis of Error-Resilient LRCs for DSSs With Silent Disk Errors
IEEE Access, 2021 Recently, erasure coding techniques are considered as essential schemes for the reliability of the modern distributed storage systems (DSSs) with the frequent node-level failure.
Chanki Kim, Jong-Seon No
doaj +1 more source
Locally Repairable Convolutional Codes with Sliding Window Repair [PDF]
2019 IEEE International Symposium on Information Theory (ISIT), 2019 Locally repairable convolutional codes (LRCCs) for distributed storage systems (DSSs) are introduced in this work. They enable local repair, for a single node erasure (or more generally, $ \partial - 1 $ erasures per local group), and sliding-window global repair, which can correct erasure patterns with up to $ {\rm d}^c_j - 1 $ erasures in every ...
Umberto Martinez-Penas, Diego Napp
openaire +3 more sources
On optimal ternary locally repairable codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 5 ...
Hao, Jie, Xia, Shu-Tao, Chen, Bin
openaire +2 more sources
Optimal Locally Repairable Codes for Parallel Reading
IEEE Access, 2020 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, δ)-information-locality, where each of the i-th (1 ≤ i ≤ k) information symbol is ...
Jie Hao +3 more
doaj +1 more source
On the Generalized Hamming Weights of (
IEEE Access, 2020 Locally repairable codes (LRCs) have attracted a lot of interests recently due to their important applications in distributed storage systems. An (n, k, r, δ)-LRC (δ ≥ 2) is an [n, k, d] linear code such that each of the n code ...
Jie Hao, Bin Chen
doaj +1 more source
New Constructions of Short Length Binary Locally Repairable Codes
IEEE Access, 2020 In this short paper, our main objective is to construct binary locally repairable codes (LRCs) with good properties. Two constructions of LRCs with short lengthes are proposed.
Sen Yang, Ruihu Li, Qiang Fu, Jingjie Lv
doaj +1 more source