摘要
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, delta)-LRCs with unbounded length and minimum distance delta + 2 <= delta <= 2 delta from their zeros. Two classes of optimal cyclic (r, delta)-LRCs with large minimum distance are also presented.