Results 31 to 40 of about 2,942 (253)

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, Jung-Hyun Kim, Hong-Yeop Song   +2 more
openaire   +2 more sources

Optimal Locally Repairable and Secure Codes for Distributed Storage Systems [PDF]

, 2013
This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSS). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to ...
Koyluoglu, O. Ozan, Rawat, Ankit Singh, Silberstein, Natalia, Vishwanath, Sriram   +3 more
core   +1 more source

Optimal (r, δ)-Locally Repairable Codes From Simplex Code and Cap Code

IEEE Access, 2020
Locally repairable codes (LRCs) are implemented in distributed storage systems (DSSs) due to their low repair overhead. A linear code $\mathcal {C}$ is said to have $(r,\delta)$ -locality if for each coordinate $i$ , there exists a punctured subcode ...
Qiang Fu, Ruihu Li, Sen Yang
doaj   +1 more source

Binary cyclic codes that are locally repairable [PDF]

2014 IEEE International Symposium on Information Theory, 2014
Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite field to be practically significant and be tolerant to a large number of erasures.
Goparaju, Sreechakra, Calderbank, Robert
openaire   +2 more sources

On Constructions of a Class of Binary Locally Repairable Codes With Multiple Repair Groups

IEEE Access, 2017
Recently, Hao and Xia noted a connection between a class of binary locally repairable codes (LRCs) with multiple repair groups and binary low-density parity-check (LDPC) codes, and proposed a framework for constructing binary LRCs from LDPC codes as well
Yi-Sheng Su
doaj   +1 more source

Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups [PDF]

SIAM Journal on Discrete Mathematics, 2019
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However, most known constructions are over large fields with sizes close to the code length, which lead to the systems ...
Ma, Jingxue, Ge, Gennian
openaire   +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.
Westerbäck, Thomas, Freij-Hollanti, Ragnar, Hollanti, Camilla, Ernvall, Toni   +4 more
openaire   +4 more sources

Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and $K-1$

IEEE Access, 2019
A locally repairable code (LRC) is a [n, k, d] linear code with length n, dimension k, minimum distance d and locality r, which means that every code symbol can be repaired by at most r other symbols.
Yichong Xia, Bin Chen
doaj   +1 more source

Bounding multiple unicasts through index coding and Locally Repairable Codes [PDF]

2014 IEEE International Symposium on Information Theory, 2014
We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Repairable Codes (GLCRs) are exactly dual to linear index codes. In a GLRC, every node is decodable from a specific set of other nodes and these sets induce a recoverability ...
Shanmugam, Karthikeyan, Dimakis, Alexandros G.   +1 more
openaire   +2 more sources

Construction of Optimal Locally Repairable Codes of Triangular Association Schemes

Shanghai Jiaotong Daxue xuebao
As a new erasure code for distributed storage systems, locally repairable codes (LRCs) can effectively realize the reliable and efficient storage of massive data.
WANG Jing, LI Jinghui, YANG Jiarong, WANG E
doaj   +1 more source