Results 31 to 40 of about 402 (270)
Optimal locally repairable codes of distance 3 and 4 via cyclic codes [PDF]
, 2018 Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of [16], several classes of optimal locally repairable
Luo, Yuan +5 more
core +1 more source
Optimal (
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
Locally repairable codes with high availability based on generalised quadrangles
, 2020 Locally Repairable Codes (LRC's) based on generalised quadrangles were introduced by Pamies-Juarez, Hollmann and Oggier in [3], and bounds on the repairability and availability were derived. In this paper, we determine the values of the repairability and
Lavrauw, Michel, Van de Voorde, Geertrui
core +2 more sources
Binary Linear Locally Repairable Codes [PDF]
IEEE Transactions on Information Theory, 2016 Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do not explicitly take into consideration the field size $q$, i.e., the size of the code alphabet.
Pengfei Huang 0001 +3 more
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
Locally Repairable Codes With Unequal Local Erasure Correction [PDF]
IEEE Transactions on Information Theory, 2018 Changes including additional results.
Geonu Kim, Jungwoo Lee 0001
openaire +3 more sources
Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and
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
Optimal Locally Repairable Linear Codes [PDF]
IEEE Journal on Selected Areas in Communications, 2014 Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, δ})-locality, denoted as (r, δ)a, is considered optimal if it also meets the minimum Hamming distance bound. The existing results on the existence and the construction of optimal (r, δ)a codes are limited to only the
Wentu Song +3 more
openaire +2 more sources
Construction of Optimal Locally Repairable Codes of Triangular Association Schemes
Shanghai Jiaotong Daxue xuebaoAs 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
Optimal Locally Repairable Codes Via Elliptic Curves
, 2018 Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg first gave a breakthrough result in this topic by
Ma, Liming +5 more
core +1 more source