Results 21 to 30 of about 2,942 (253)
Repair Duality with Locally Repairable and Locally Regenerating Codes [PDF]
2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech), 2017 Accepted as a full paper for publication at IEEE DataCom ...
Gligoroski, Danilo +3 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
Locally Repairable Codes With Unequal Local Erasure Correction [PDF]
IEEE Transactions on Information Theory, 2018 Changes including additional results.
Geonu Kim, Jungwoo Lee
openaire +2 more sources
Binary Locally Repairable Codes - Sequential Repair for Multiple Erasures [PDF]
2016 IEEE Global Communications Conference (GLOBECOM), 2016 6 pages, 4 ...
Song, Wentu, Yuen, Chau
openaire +2 more sources
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
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 {\it optimal} if it achieves the Singleton-type bound).
Luo, Yuan, Xing, Chaoping, Yuan, Chen
core +3 more sources
On Sequential Locally Repairable Codes [PDF]
IEEE Transactions on Information Theory, 2018 We consider the locally repairable codes (LRCs), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called $(n, k, r, t)$ -sequential LRCs (SLRC) as an $[n,k]$ linear code, where any $t'~(\leq t)$ erasures can be sequentially recovered, each by $r~(2\leq r other code symbols.
Wentu Song +4 more
openaire +1 more source
On the Single-Parity Locally Repairable Codes with Multiple Repairable Groups
Information, 2018 Locally repairable codes (LRCs) are a new family of erasure codes used in distributed storage systems which have attracted a great deal of interest in recent years.
Yanbo Lu, Xinji Liu, Shutao Xia
doaj +1 more source
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 +3 more
openaire +2 more sources