Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
