Results 21 to 30 of about 402 (270)
Local codes with addition based repair [PDF]
2015 IEEE Information Theory Workshop - Fall (ITW), 2015 We consider the complexities of repair algorithms for locally repairable codes and propose a class of codes that repair single node failures using addition operations only, or codes with addition based repair. We construct two families of codes with addition based repair.
Han Mao Kiah +3 more
openaire +2 more sources
New Constructions of Short Length Binary Locally Repairable Codes
IEEE Access, 2020 In this short paper, our main objective is to construct binary locally repairable codes (LRCs) with good properties. Two constructions of LRCs with short lengthes are proposed.
Sen Yang, Ruihu Li, Qiang Fu, Jingjie Lv
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.
Sreechakra Goparaju +1 more
openaire +2 more sources
Local Codes With Cooperative Repair in Distributed Storage of Cyber-Physical-Social Systems
IEEE Access, 2020 Integrating cyber, physical, and social spaces together, cyber-physical-social systems (CPSS) bring more conveniences to humans. For practical applications and user convenience, it is essential that the Big Data produced in CPSS be stored in the ...
Jing Wang +4 more
doaj +1 more source
Girth-Based Sequential-Recovery LRCs
IEEE Access, 2022 In this paper, we prove that a linear block code with girth $2(t+1)$ is a $t$ -sequential-recovery locally repairable codes (LRCs) with locality $r$ if its parity-check matrix has column weight at least 2 and row weight at most $r+1$ . This gives a
Zhi Jing, Hong-Yeop Song
doaj +1 more source
On optimal ternary locally repairable codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 5 ...
Jie Hao 0001, Shu-Tao Xia, Bin Chen 0011
openaire +2 more sources
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes
, 2022 Linear codes have widespread applications in data storage systems. There are two major contributions in this paper. We first propose infinite families of optimal or distance-optimal linear codes over Fp constructed from projective spaces.Moreover, a ...
Luo, Gaojun, Ling, San
core +1 more source
Some New Sequential-Recovery LRCs Based on Good Polynomials
IEEE Access, 2022 We propose a new construction of sequential-recovery Locally Repairable Codes (LRCs) of length $n$ with even locality $r$ for two erasures, based on some ‘good’ polynomials, over a relatively small alphabet of size $q \approx \frac {(r+
Zhi Jing, Hong-Yeop Song
doaj +1 more source
List Decoding of Locally Repairable Codes [PDF]
2018 IEEE International Symposium on Information Theory (ISIT), 2018 We show that locally repairable codes (LRCs) can be list decoded efficiently beyond the Johnson radius for a large range of parameters by utilizing the local error correction capabilities. The new decoding radius is derived and the asymptotic behavior is analyzed.
Lukas Holzbaur, Antonia Wachter-Zeh
openaire +2 more sources
On Sequential Locally Repairable Codes
CoRR, 2016 We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n,k,r,t)-SLRC (Sequential Locally Repairable Codes) as an [n,k] linear code where any t'(>= t) erasures can be sequentially recovered, each one by r (2<=r=3 erasures and bounds to evaluate the performance of such codes.
Wentu Song, Kai Cai 0001, Chau Yuen
openaire +2 more sources