We propose locally rewritable codes (LWC) for resistive memories inspired by locally repairable codes (LRC) for distributed storage systems. Small values of repair locality of LRC enable fast repair of a single failed node since the lost data in the failed node can be recovered by accessing only a small fraction of other nodes. By using rewriting locality, LWC can improve endurance and power consumption which are major challenges for resistive memories. We point out the duality between LRC and LWC, which indicates that existing construction methods of LRC can be applied to construct LWC.1
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
A code is called a locally recoverable code (LRC) with locality r if any symbol of a codeword can be...
textDistributed storage systems (a.k.a. cloud storage networks) are becoming increasingly important,...
Abstract—Distributed storage systems need to store data re-dundantly in order to provide some fault-...
Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of...
Regenerating codes and codes with locality are schemes recently proposed for a distributed storage n...
In this paper, a new family of binary LRCs (BLRCs) with locality 2 and uneven availabilities for hot...
Abstract—This paper presents a new explicit construction for locally repairable codes (LRCs) for dis...
Regenerating codes and codes with locality are two schemes that have recently been proposed to ensur...
Regenerating codes and codes with locality are two coding schemes that have recently been proposed, ...
Regenerating codes and codes with locality are two coding schemes that have recently been proposed, ...
Abstract—We consider the design of regenerating codes for distributed storage systems that enjoy the...
Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when f...
Abstract—This paper aims to go beyond resilience into the study of security and local-repairability ...
Abstract—Petabyte-scale distributed storage systems are cur-rently transitioning to erasure codes to...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
A code is called a locally recoverable code (LRC) with locality r if any symbol of a codeword can be...
textDistributed storage systems (a.k.a. cloud storage networks) are becoming increasingly important,...
Abstract—Distributed storage systems need to store data re-dundantly in order to provide some fault-...
Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of...
Regenerating codes and codes with locality are schemes recently proposed for a distributed storage n...
In this paper, a new family of binary LRCs (BLRCs) with locality 2 and uneven availabilities for hot...
Abstract—This paper presents a new explicit construction for locally repairable codes (LRCs) for dis...
Regenerating codes and codes with locality are two schemes that have recently been proposed to ensur...
Regenerating codes and codes with locality are two coding schemes that have recently been proposed, ...
Regenerating codes and codes with locality are two coding schemes that have recently been proposed, ...
Abstract—We consider the design of regenerating codes for distributed storage systems that enjoy the...
Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when f...
Abstract—This paper aims to go beyond resilience into the study of security and local-repairability ...
Abstract—Petabyte-scale distributed storage systems are cur-rently transitioning to erasure codes to...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
A code is called a locally recoverable code (LRC) with locality r if any symbol of a codeword can be...
textDistributed storage systems (a.k.a. cloud storage networks) are becoming increasingly important,...