Work

Locally recoverable codes with multiple recovering sets from maximal curves

Year: 2026

Type: article

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.

Source: Cryptography and Communications

DOI: 10.1007/s12095-026-00891-1

Authors: Saeed Tafazolian, Jaap Top

Institutions: Universidade Estadual de Campinas (UNICAMP), University of Groningen

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,190

Funders: Fundação de Amparo à Pesquisa do Estado de São Paulo, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Fundação Amazônia Paraense de Amparo à Pesquisa