Abstract
In this work we present a class of locally recoverable codes, i.e. codes where an erasure at a position P of a codeword may be recovered from the knowledge of the entries in the positions of a recovery set $$R_P$$ . The codes in the class that we define have availability, meaning that for each position P there are several distinct recovery sets. Also, the entry at position P may be recovered even in the presence of erasures in some of the positions of the recovery sets, and the number of supported erasures may vary among the various recovery sets.
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.
