Back to Search
Start Over
Regular (k, R, 1)-packings with $\max \limits {(R)}=3$ and their locally repairable codes
- Source :
- Cryptography and Communications. 12:1071-1089
- Publication Year :
- 2020
- Publisher :
- Springer Science and Business Media LLC, 2020.
-
Abstract
- 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.
- Subjects :
- Discrete mathematics
Code (set theory)
Sequence
Computer Networks and Communications
Group (mathematics)
Applied Mathematics
020206 networking & telecommunications
0102 computer and information sciences
02 engineering and technology
Disjoint sets
01 natural sciences
Block design
Set (abstract data type)
Combinatorial design
Computational Theory and Mathematics
010201 computation theory & mathematics
0202 electrical engineering, electronic engineering, information engineering
Langford pairing
Mathematics
Subjects
Details
- ISSN :
- 19362455 and 19362447
- Volume :
- 12
- Database :
- OpenAIRE
- Journal :
- Cryptography and Communications
- Accession number :
- edsair.doi...........64bce80e729001add9761c657e0815dd