TY - JOUR
T1 - Two classes of optimal LRCs with information (r, t)-locality
AU - Tan, Pan
AU - Zhou, Zhengchun
AU - Sidorenko, Vladimir
AU - Parampalli, Udaya
N1 - Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2020/9/1
Y1 - 2020/9/1
N2 - Locally repairable codes (LRCs) with (r, t)-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information (r, t)-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481–4493, 2016).
AB - Locally repairable codes (LRCs) with (r, t)-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information (r, t)-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481–4493, 2016).
KW - Distributed storage systems
KW - Locally repairable codes
KW - Multiple failures
KW - Partial geometry
KW - Repair locality
UR - http://www.scopus.com/inward/record.url?scp=85079814662&partnerID=8YFLogxK
U2 - 10.1007/s10623-020-00728-9
DO - 10.1007/s10623-020-00728-9
M3 - Article
AN - SCOPUS:85079814662
SN - 0925-1022
VL - 88
SP - 1741
EP - 1757
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
IS - 9
ER -