New Constructions of Optimal $(r,δ)$-LRCs via Algebraic Function Fields
For distributed storage systems, this work provides new optimal LRCs with longer lengths and flexible parameters, advancing the state of the art in code construction.
This paper constructs optimal $(r,δ)$-LRCs achieving the Singleton-type bound using algebraic function fields, obtaining explicit families with lengths up to $q + 2g\\sqrt{q}$ and flexible minimum distances. Many of these codes achieve the largest known lengths among existing constructions.
Constructing optimal $(r,δ)$-LRCs that attain the Singleton-type bound is an active and important research direction, particularly due to their practical applications in distributed storage systems. In this paper, we focus on the construction of optimal $(r,δ)$-LRCs with flexible minimum distances, especially for the case $δ\geq 3$. We first extend a general framework -- originally proposed by Li \textit{et al.} (IEEE Trans. Inf. Theory, vol. 65, no. 1, 2019) and Ma and Xing (J. Comb. Theory Ser. A., vol. 193, 2023) -- for constructing optimal $r$-LRCs via automorphism groups of elliptic function fields to the case of $(r,δ)$-LRCs. This newly extended general framework relies on certain conditions concerning the group law of elliptic curves. By carefully selecting elliptic function fields suitable for this framework, we arrive at several families of explicit $q$-ary optimal $(r,3)$-LRCs and $(2,δ)$-LRCs with lengths slightly less than $q + 2\sqrt{q}$. Next, by employing automorphism groups of hyperelliptic function fields of genus $2$, we develop a framework for constructing optimal $(r,3)$-LRCs and obtain a family of explicit $q$-ary optimal $(4,3)$-LRCs with code lengths slightly below $q+4\sqrt{q}$. We then consider the construction of optimal $(r,δ)$-LRCs via hyperelliptic function fields of arbitrary genus $g \geq 2$, yielding a class of explicit $q$-ary optimal $(g+1-g',g+1+g')$-LRCs for $0 \leq g' \leq g-1$ with lengths up to $q + 2g\sqrt{q}$. Finally, applying certain superelliptic curves derived from modified Norm-Trace curves, we construct two families of explicit optimal $(r,δ)$-LRCs with even longer code lengths and more flexible parameters. Notably, many of the newly constructed optimal $(r,δ)$-LRCs attain the largest known lengths among existing constructions with flexible minimum distances.