Abstract
Locally repairable codes (LRCs) were proposed to reduce the repair degree in distributed storage systems. In particular, LRCs with availability are highly desirable for distributed storage systems, since this kind of codes provide the mechanism of local repair for code symbols and parallel reading of hot data. In this paper, we propose four types of $(n,k,r,t)_q$ LRCs from combinatorial designs. We introduce several constructions of LRCs with strict availability and some constructions of distance-optimal LRCs with information-symbol locality. Most of our constructions in this paper are over $\mathbb{F}_2$, i.e., they are suitable for implementation.
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.
