Locally recoverable codes with multiple recovering sets from maximal curves
By: Saeed Tafazolian, Jaa Top
Potential Business Impact:
Fixes data errors even when some parts are lost.
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.
Similar Papers
Locally Recoverable Codes with availability from a family of fibered surfaces
Algebraic Geometry
Makes data storage more reliable and error-proof.
New Wide Locally Recoverable Codes with Unified Locality
Distributed, Parallel, and Cluster Computing
Keeps data safe even if some parts break.
New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
Information Theory
Fixes lost data in computer storage faster.