Results 1 to 10 of about 402 (270)
Construction of Binary Locally Repairable Codes with Nonuniform Locality and Availability Using Combinatorial Designs. [PDF]
Entropy (Basel)In this paper, we generalize the construction of locally repairable codes (LRCs) by leveraging pairwise balanced designs (PBDs) and balanced incomplete block designs (BIBDs) to construct codes with nonuniform locality or nonuniform availability.
Zhang Y, Zeng X.
europepmc +3 more sources
A connection between locally repairable codes and exact regenerating codes [PDF]
2016 IEEE International Symposium on Information Theory (ISIT), 2016 Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those of the other. In this paper, a novel connection between locally repairable codes and exact regenerating codes is established.
Toni Ernvall +2 more
exaly +6 more sources
New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data. [PDF]
Entropy (Basel), 2018 In this paper, a new family of binary LRCs (BLRCs) with locality 2 and uneven availabilities for hot data is proposed, which has a high information symbol availability and low parity symbol availabilities for the local repair of distributed storage ...
Lee KS, Park H, No JS.
europepmc +2 more sources
Locally repairable codes [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of off-the-shelf erasure codes is their high-repair cost during single node failure events. A major open problem in this area has
Dimitris S. Papailiopoulos +1 more
openaire +4 more sources
Balanced locally repairable codes [PDF]
2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2016 We introduce a family of balanced locally repairable codes (BLRCs) $[n, k, d]$ for arbitrary values of $n$, $k$ and $d$. Similar to other locally repairable codes (LRCs), the presented codes are suitable for applications that require a low repair locality.
Katina Kralevska +2 more
openaire +3 more sources
Locally Repairable Fractional Repetition Codes
The Journal of Korean Institute of Communications and Information Sciences, 2015 In this paper, we introduce new locally repairable codes based on a Fractional repetition codes which is one of the MBR codes. We introduce two different constructions for different system parameters and compare these codes in terms of several performance metrics. There is some tradeoffs between the locality and other performance metrics.
Mi-Young Nam +2 more
exaly +3 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
On the Average Locality of Locally Repairable Codes [PDF]
IEEE Transactions on Communications, 2018 A linear block code with dimension $k$, length $n$, and minimum distance $d$ is called a locally repairable code (LRC) with locality $r$ if it can retrieve any coded symbol by at most $r$ other coded symbols. LRCs have been recently proposed and used in practice in distributed storage systems (DSSs) such as Windows Azure storage and Facebook HDFS-RAID.
Mostafa Shahabinejad +2 more
openaire +2 more sources