Alphabet-Dependent Bounds for Locally Repairable Codes With Joint Information Availability

作者：Kim Jung Hyun; Song Hong Yeop^*

来源：IEEE Communications Letters, 2017, 21(8): 1687-1690.

DOI：10.1109/LCOMM.2017.2699968

• Distributed storage systems
• locally repairable codes
• locality
• availability
• alphabet-dependent bounds

In this letter, we investigate a class of codes with the following property: any decodable set of erased symbols can be repaired from any single set of several disjoint symbol sets with small cardinality. We refer such codes to locally repairable codes (LRCs) with joint availability. In particular, if information symbols of a code have this property, then we refer the code to an LRC with joint information availability. We propose two alphabet-dependent bounds for LRCs with joint information availability. From the bounds, we rederive some well-known bounds for LRCs. Based on the relation between LRCs and batch codes, we also present an alternative proof of an existing bound for batch codes. Finally, we show the achievability and tightness of the proposed bounds using graph-based codes.

• 出版日期2017-8