Results 11 to 20 of about 459 (161)
On the Single-Parity Locally Repairable Codes with Multiple Repairable Groups
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 +2 more sources
Co-Testing of Cervical Screening Tests in Detection of High Grade Cervical Intraepithelial Neoplasia [PDF]
Introduction: Co-testing performance for detection of high grade Cervical Intraepithelial Neoplasia (CIN) has not been adequately addressed from Low Resource Countries (LRCs).
Smita Asthana +3 more
doaj +2 more sources
The United Nations Sustainable Development Goals 2015 to 2030 includes a specific goal for health (Sustainable Development Goal [SDG] 3) with 13 targets, including SDG3.4 for the control and treatment of noncommunicable diseases (NCDs), namely ...
Graeme W. Morgan +4 more
doaj +2 more sources
Some New Sequential-Recovery LRCs Based on Good Polynomials
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 for Parallel Reading
Locally repairable codes (LRCs) have important applications in distributed storage systems. In this paper, we study q-ary [n, k, d] LRCs with (r, t, δ)-information-locality, where each of the i-th (1 ≤ i ≤ k) information symbol is ...
Jie Hao +3 more
doaj +1 more source
Optimal (
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
Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and
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
On the Generalized Hamming Weights of (
Locally repairable codes (LRCs) have attracted a lot of interests recently due to their important applications in distributed storage systems. An (n, k, r, δ)-LRC (δ ≥ 2) is an [n, k, d] linear code such that each of the n code ...
Jie Hao, Bin Chen
doaj +1 more source
A Construction of Optimal
Locally recoverable codes (LRCs) play a significant role in distributed and cloud storage systems. The key ingredient for constructing such optimal LRCs is to characterize the parity-check matrix for LRCs.
Bocong Chen, Jing Huang
doaj +1 more source
A function field approach toward good polynomials for further results on optimal LRC codes
Because of the recent applications to distributed storage systems, researchers have introduced a new class of block codes, i.e., locally recoverable (LRC) codes. LRC codes can recover information from erasure(s) by accessing a small number of erasure-free code symbols and increasing the efficiency of repair processes in large-scale distributed storage ...
Ruikai Chen, Sihem Mesnager
openaire +6 more sources

