Optimal cyclic locally repairable codes with unbounded length from their zeros

Abstract

Listen

Translate article

In distributed storage systems, locally repairable codes (LRCs) can effectively reduce the complexity of repairing failed nodes. In this paper, we constructed six classes of optimal cyclic (r,δ)-LRCs with unbounded length and minimum distance δ+2≤d≤2δ from their zeros. Two classes of optimal cyclic (r,δ)-LRCs with large minimum distance are also presented.