E-resources
Peer reviewed
-
Jiang, Jing; Cheng, Minquan
Cryptography and communications, 11/2020, Volume: 12, Issue: 6Journal Article
The concept of a locally repairable code (LRC) was introduced to protect the data from disk failures in large-scale storage systems. In this paper, we consider the LRCs with multiple disjoint repair sets and each repair set contains exactly one check symbol. By using several structures from combinatorial design theory, such as balanced incomplete block design, cyclic packing, group divisible design, near-Skolem sequence and Langford sequence, we construct several infinite classes of LRCs with the size of each repair set at most 3, which are optimal with respect to the bound proposed by Rawat et al. in 2016.
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.