Locally recoverable codes with multiple recovering sets from maximal curves
Algebraic Geometry
2025-09-19 v1 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.2509.15163,
title = {Locally recoverable codes with multiple recovering sets from maximal curves},
author = {Saeed Tafazolian and Jaa Top},
journal= {arXiv preprint arXiv:2509.15163},
year = {2025}
}