Locally recoverable codes with multiple recovering sets from maximal curves
September 18, 2025 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Saeed Tafazolian, Jaa Top
arXiv ID
2509.15163
Category
math.AG
Cross-listed
cs.IT
Citations
1
Venue
arXiv.org
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.AG
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Two-point AG codes on the GK maximal curves
R.I.P.
π»
Ghosted
Congruences and Concurrent Lines in Multi-View Geometry
R.I.P.
π»
Ghosted
Quantum codes from a new construction of self-orthogonal algebraic geometry codes
R.I.P.
π»
Ghosted
The Chow Form of the Essential Variety in Computer Vision
R.I.P.
π»
Ghosted
Algebraic Geometric codes from Kummer Extensions
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted