Results 11 to 20 of about 402 (270)
On Sequential Locally Repairable Codes [PDF]
IEEE Transactions on Information Theory, 2018 We consider the locally repairable codes (LRCs), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called $(n, k, r, t)$ -sequential LRCs (SLRC) as an $[n,k]$ linear code, where any $t'~(\leq t)$ erasures can be sequentially recovered, each by $r~(2\leq r other code symbols.
Wentu Song +4 more
openaire +2 more sources
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 Martínez-Peñas, Diego Napp
openaire +5 more sources
On the Single-Parity Locally Repairable Codes with Multiple Repairable Groups
Information, 2018 Locally repairable codes (LRCs) are a new family of erasure codes used in distributed storage systems which have attracted a great deal of interest in recent years.
Yanbo Lu, Xinji Liu, Shutao Xia
doaj +2 more sources
InformationLocally Repairable Codes (LRCs) have become the dominant design in wide-stripe erasure coding storage systems due to their excellent locality and low repair bandwidth.
Yan Wang, Yanghuang Cao, Junhao Shi
doaj +2 more sources
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
Repair Duality with Locally Repairable and Locally Regenerating Codes [PDF]
2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech), 2017 We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes.
Danilo Gligoroski +3 more
openaire +2 more sources
Locally repairable codes with multiple repair alternatives [PDF]
2013 IEEE International Symposium on Information Theory, 2013 Distributed storage systems need to store data redundantly in order to provide some fault-tolerance and guarantee system reliability. Different coding techniques have been proposed to provide the required redundancy more efficiently than traditional replication schemes.
Lluis Pamies-Juarez +2 more
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 weight hierarchy of locally repairable codes [PDF]
2017 IEEE Information Theory Workshop (ITW), 2017 8 ...
Jie Hao 0001 +3 more
openaire +2 more sources
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