Results 241 to 250 of about 402 (270)
Overview of Binary Locally Repairable Codes for Distributed Storage Systems
Electronics (Switzerland), 2019 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,
Young-Sik Kim +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Optimal Quaternary Locally Repairable Codes
2021 IEEE International Symposium on Information Theory (ISIT), 2021A $q$ -ary ( $n, k, r$ ) locally repairable code (LRC) is an [ $n, k, d$ ] linear code where every code symbol can be repaired by accessing at most $r$ other code symbols. Its minimum distance satisfies the well-known Singleton-like bound. In this paper, we determine all the possible parameters of quaternary LRCs attaining this Singleton-like bound ...
Jie Hao 0001 +4 more
openaire +1 more source
Locally repairable codes with locality 1 and availability
2016 International Conference on Information and Communication Technology Convergence (ICTC), 2016In this paper, we propose an optimal scalar locally repairable code (LRC) with locality 1 in the sense of achieving the maximum possible minimum distance using the serial concatenation technique. A technique to construct an optimal vector LRC with locality 1 based on the proposed scalar LRC is also provided.
Mi-Young Nam +2 more
openaire +1 more source
Locally Repairable Codes with Heterogeneous Locality Constraints
2018 IEEE Information Theory Workshop (ITW), 2018A code over a finite alphabet is called locally repairable codes (LRCs) if every symbol in the encoding is a function of a small number of other symbols of the codeword. In this paper, we study LRCs with heterogeneous locality constraints. We introduce $(n,\ k,\ r_{i},\ \delta_{i},\ i\ \in\ [m])$ LRCs which generalize the LRCs with equal $(r,\ \delta)$-
Qi Chen 0024 +2 more
openaire +1 more source
Linear locally repairable codes with availability
2015 IEEE International Symposium on Information Theory (ISIT), 2015In this work, we present a new upper bound on the minimum distance d of linear locally repairable codes (LRCs) with information locality and availability. The bound takes into account the code length n, dimension k, locality r, availability t, and field size q. We use tensor product codes to construct several families of LRCs with information locality,
Pengfei Huang 0001 +3 more
openaire +1 more source
On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes
ACM Transactions on Storage, 2020Erasure codes in large-scale storage systems allow recovery of data from a failed node. A recently developed class of codes, locally repairable codes (LRCs), offers tradeoffs between storage overhead and repair cost. LRCs facilitate efficient recovery scenarios by adding parity blocks to the system.
Oleg Kolosov +4 more
openaire +2 more sources
A Class of Binary Locally Repairable Codes
IEEE Transactions on Communications, 2016An $(n,k)$ erasure code that can recover any coded symbol by at most $r$ other coded symbols is called a locally repairable code (LRC) with locality $r$ . LRCs have been recently implemented in distributed storage systems. Coding complexity reduction can be significantly decreased by using binary LRCs (BLRCs) as they eliminate costly ...
Mostafa Shahabinejad +2 more
openaire +1 more source
Locally repairable codes with the optimum average information locality
2017 IEEE International Symposium on Information Theory (ISIT), 2017Locally repairable codes (LRCs) have been proposed and used in practice as effective coding methods for distributed storage systems (DSSs). In a DSS, information block recovery is a critical task performed in the case of data node permanent failure or temporal unavailability.
Mostafa Shahabinejad +2 more
openaire +1 more source
On the Optimal Repair-Scaling Trade-off in Locally Repairable Codes
IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, 2020How to improve the repair performance of erasure-coded storage is a critical issue for maintaining high reliability of modern large-scale storage systems. Locally repairable codes (LRC) are one popular family of repair-efficient erasure codes that mitigate the repair bandwidth and are deployed in practice.
Si Wu 0003 +2 more
openaire +1 more source
Locally Repairable Codes with Multiple $(r_{i}, δ_{i})$-Localities
CoRR, 20176 ...
Bin Chen 0011, Shu-Tao Xia, Jie Hao 0001
openaire +2 more sources