Abstract
As a new class of erasure codes, locally repairable codes (LRCs) can provide data repair capability for distributed storage system. In this paper, we firstly propose an effective construction method to obtain optimal LRCs based on ternary optimal codes. Then, three classes of optimal LRCs are constructed by ternary cyclic codes and constant cyclic codes. All codes we gained have the optimal distance and reach the Cadambe-Mazumdar (C-M) bound.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
