Locally recoverable codes with multiple recovering sets from maximal curves
Abstract: In this paper, we present a construction of locally recoverable codes (LRCs) with multiple recovery sets using algebraic curves with many rational points. By leveraging separable morphisms between smooth projective curves and expanding the class of curves previously considered, we significantly generalize and enhance the framework. Our approach corrects certain inaccuracies in the existing literature while extending results to a broader range of curves, thereby achieving better parameters and wider applicability. In addition, the constructions presented here result in LRCs with large availability.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.