Abstract
Locally repairable code (LRC) in distributed storage system decreases repair degree of failed nodes. LRC with availability is extremely desired in distributed storage system because it permits local repair of failed nodes and parallel access of hot data. In this paper, a novel construction of LRCs with availability is proposed. Explicitly, by matrix iteration, two families of LRCs with all symbol locality and availability are constructed. The first family LRC is SA-LRC and keeps the code structure binary which is convenient to apply. The second family LRC is systematic code and possesses inspiring information rate $\frac{r}{{r + 2}}$. Our construction is concise and explicit parity-check matrices of LRCs are given.
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.
