Paper Info
Title
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
Abstract
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a new combination of codes with locality and codes with multiple disjoint repair sets (also called availability) is introduced. Accordingly, a Singleton-type bound is derived for the new code, which contains those bounds in <xref ref-type="bibr" rid="ref9" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[9]</xref> , <xref ref-type="bibr" rid="ref20" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[20]</xref> , <xref ref-type="bibr" rid="ref28" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[28]</xref> as special cases. Optimal constructions are proposed with respect to the new bound. In addition, these constructions can also generate optimal codes with multiple disjoint repair sets with respect to the bound in <xref ref-type="bibr" rid="ref28" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[28]</xref> , which to the best of our knowledge, are the first explicit constructions that can achieve the bound in <xref ref-type="bibr" rid="ref28" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[28]</xref> .
Year
DOI
Venue
2020
10.1109/TIT.2019.2944397
IEEE Transactions on Information Theory
Keywords
DocType
Volume
Availability,distributed storage,locally repairable code
Journal
66
Issue
ISSN
Citations 
4
0018-9448
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Han Cai1927.41
Ying Miao249143.85
Moshe Schwartz334535.86
Xiaohu Tang41294121.15