Two classes of optimal LRCs with information (r, t)-locality

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 becom...

Full description

Saved in:
Bibliographic Details
Published inDesigns, codes, and cryptography Vol. 88; no. 9; pp. 1741 - 1757
Main Authors Tan, Pan, Zhou, Zhengchun, Sidorenko, Vladimir, Parampalli, Udaya
Format Journal Article
LanguageEnglish
Published New York Springer US 01.09.2020
Springer Nature B.V
Subjects
Coding and Information Theory
Computer Science
Cryptology
Discrete Mathematics in Computer Science
Linear algebra
Parameters
Special Issue: Coding and Cryptography 2019
Storage systems
Partial geometry
Repair locality
94B25
11T71
Distributed storage systems
Locally repairable codes
94B60
94A60
Multiple failures
Online AccessGet full text

Cover

More Information
Summary: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).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-020-00728-9