This paper introduces new algebraic geometric methods for constructing optimal locally repairable codes with flexible minimum distances, achieving some of the longest known code lengths for such parameters.
Contribution
It extends existing frameworks using elliptic, hyperelliptic, and superelliptic curves to construct explicit optimal $(r,\,\delta)$-LRCs with lengths approaching theoretical bounds.
Findings
01
Constructed explicit optimal $(r,3)$-LRCs with lengths near $q + 2\sqrt{q}$.
02
Developed families of optimal $(r,3)$-LRCs and $(g+1-g',g+1+g')$-LRCs with lengths up to $q + 2g\sqrt{q}$.
03
Achieved some of the longest known code lengths among existing constructions with flexible minimum distances.
Abstract
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 δ≥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…
Tables1
Table 1. TABLE I: Known Constructions of q q -ary Optimal ( r , δ ) (r,\delta) -LRCs with Flexible Minimum Distances and Lengths ≥ q \geq q
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cryptography and Residue Arithmetic · Interconnection Networks and Systems
Full text
New Constructions of Optimal (r,δ)-LRCs via Algebraic Function Fields
Yuan Gao,
Haoming Shi,
Weijun Fang
Yuan Gao, Haoming Shi, and Weijun Fang are with State Key Laboratory of Cryptography and Digital Economy Security, Shandong University, Qingdao, 266237, China, Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Qingdao, 266237, China and School of Cyber Science and Technology, Shandong University, Qingdao, 266237, China (emails: [email protected], [email protected], [email protected]).
The work is supported in part
by the National Key Research and Development Program of China under Grant Nos. 2022YFA1004900 and 2021YFA1001000, the National Natural Science Foundation of China under Grant No. 62201322, the Natural Science Foundation of Shandong Province under
Grant No. ZR2022QA031, and the Taishan Scholar Program of Shandong Province. (Corresponding Author: Weijun Fang).Manuscript submitted
Abstract
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 δ≥3.
We first extend a general framework—originally proposed by Li 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+2q.
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+4q. We then consider the construction of optimal (r,δ)-LRCs via hyperelliptic function fields of arbitrary genus g≥2, yielding a class of explicit q-ary optimal (g+1−g′,g+1+g′)-LRCs for 0≤g′≤g−1 with lengths up to q+2gq.
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.
To reduce the repair overhead of failed nodes in large-scale distributed storage systems, the concept of locally repairable codes (LRCs), also known as locally recoverable codes, was formally introduced in [1] by Gopalan et al.
Let [n]:={1,2,…,n}. For a linear code C of length n over the finite field Fq, a code symbol ci of C has locality r
if there exists a subset Ri⊆[n] such that i∈Ri,∣Ri∣≤r+1
and ci is a linear combination of {cj}j∈Ri\{i} over Fq. Here, Ri is called a local repair group of the i-th symbol ci.
A linear code C is called an r-locally repairable code (r-LRC) if each code symbol of C has locality r. However, when multiple node failures occur in a distributed storage
system, the r-LRCs can not recover failed nodes efficiently. To address this problem, Prakash et al. [2] generalized the concept of r-LRCs to
(r,δ)-LRCs which can tolerate any δ−1 erasures (δ≥2). A code symbol ci of C has (r,δ)-locality if there exists a subset Ri⊆[n] containing i such that ∣Ri∣≤r+δ−1
and d(C∣Ri)≥δ, where C∣Ri denotes the punctured code on the set [n]\Ri. Similarly, Ri is called a local repair group of the i-th symbol ci.
A linear code C is called an (r,δ)-locally repairable code ((r,δ)-LRC) if each code symbol of C has (r,δ)-locality. When δ=2, (r,δ)-LRCs reduce to r-LRCs. Due to their interesting
algebraic structures and practical applications in distributed storage systems, (r,δ)-LRCs have drawn significant interest in recent years. In the following, we review some known results on (r,δ)-LRCs.
I-A Some Known Results of (r,δ)-LRCs
In [1], the Singleton-type bound for r-LRCs with parameters [n,k,d]q, analogous to the classical Singleton bound for general codes, was proposed. This bound was later generalized in [2] to the case of (r,δ)-LRCs with parameters [n,k,d]q, yielding
[TABLE]
which is also called the Singleton-type bound. When δ=2, it reduces to the Singleton-type bound for r-LRCs.
If an (r,δ)-LRC achieves the Singleton-type bound (1) with equality, then it is called a Singleton-optimal (r,δ)-LRC, which we refer to simply as an optimal (r,δ)-LRC in this paper. In particular, an optimal r-LRC attaining the Singleton-type bound (1) (fixing δ=2) is called an optimal r-LRC.
Constructing optimal (r,δ)-LRCs with large code lengths over fixed finite fields is of practical importance, as it enables a reduction in the required field size and thereby lowers the overall computational complexity.
In what follows, we review some existing constructions of optimal (r,δ)-LRCs, along with relevant results on upper bounds for their code lengths. These constructions can be broadly classified into two categories based on their parameter characteristics, particularly their minimum distances.
•
The first category of constructions of optimal (r,δ)-LRCs features a flexible choice of the minimum distance d, which can be either small or proportional to the code length n, and can be adjusted as needed. These constructions are typically obtained via evaluation-based methods using tools such as polynomials [3], [4], algebraic curves and surfaces [5, 6, 7, 8, 9, 10]. Additionally, some constructions in this category are derived from cyclic and constacyclic codes, such as [11, 12, 13, 14, 15].
As for the upper bound on the length of this category of constructions, Guruswami et al. [16, Theorem 13 and Corollary 14] established an upper bound on the code length n of q-ary optimal r-LRCs with minimum distance d=Θ(n) and constant r, yielding n≤O(q). This upper bound can be generalized to the case of (r,δ)-LRCs, which similarly yields n≤O(q) for optimal (r,δ)-LRCs with minimum distance d=Θ(n), nd≤32, and constant r,δ (see Theorem A.1 in Appendix A). This bound is naturally applicable to the entire class of optimal (r,δ)-LRCs with flexible minimum distances.
Below, we briefly review the above-referenced works. In 2014, Tamo and Barg [3] made a breakthrough in constructing optimal (r,δ)-LRCs by using carefully chosen polynomials. They proposed the well-known RS-like optimal (r,δ)-LRCs, whose lengths are at most q. This famous family of codes is referred to as the Tamo–Barg codes. As a side note, Gao and Yang [4] later improved upon this result in 2024 by applying an extension technique, obtaining optimal (r,δ)-LRCs with lengths up to q+δ.
Returning to the main line of development, in 2017, Barg et al. [5, 6] extended the Tamo-Barg codes [3] by utilizing covering maps and quotient maps of algebraic curves, and selecting appropriate evaluation function spaces via the Riemann–Roch theorem. They presented several asymptotically good r-LRCs using high-genus curves and towers of function fields. Additionally, some optimal r-LRCs based on algebraic surfaces were also proposed. Although these optimal r-LRCs have small minimum distances d≤3, they offer valuable theoretical insights.
In [7], by employing the automorphism groups of the rational function
fields, Jin et al. generalized the Tamo-Barg codes [3], constructing optimal r-LRCs with code length up to q+1 and more flexible locality r.
In [8], by leveraging the rich algebraic structures of elliptic curves, Li et al. constructed optimal r-LRCs with code length reaching or slightly below q+2q for r=2,3,5,7,11,23.
They also provided many maximal elliptic curves with rich automorphism groups.
Subsequently, Ma and Xing [9] extended the results in [8] by incorporating the translation automorphism group of elliptic function fields into the construction, thereby obtaining optimal r-LRCs with a wider range of locality r. They also provided a clear exposition of the group structure of the automorphism groups of elliptic function fields. In 2021, Salgado et al. [10] proposed a family of optimal 3-LRCs with length 4q based on algebraic surfaces, which has the largest known code length among optimal r-LRCs with flexible minimum distances. Very recently, using automorphism groups of hyperelliptic curves of genus 2, Huang and Zhao [17] proposed several r-LRCs with lengths approaching q+4q and (r+1)∣240, which are either optimal or almost optimal111An (r,δ)-LRC with parameters [n,k,d]q satisfying d=n−k−(⌈k/r⌉−1)(δ−1) is referred to as an almost optimal (r,δ)-LRC..
There are also several notable results based on cyclic codes and constacyclic codes.
Motivated by the construction of Tamo-Barg codes, Tamo et al. [11, 12] constructed a family of optimal cyclic
r-LRCs with length q−1.
Later, Chen et al. [13, 14] generalized these results by employing both cyclic and constacyclic codes, and constructed several families of optimal (r,δ)-LRCs with (r+δ−1)∣n and n dividing either q−1 or q+1. These constructions were further extended by Qiu et al. [15], who unified and generalized the constructions in [13, 14], and efficiently produced optimal cyclic (r,δ)-LRCs with flexible parameters, including cases where (r+δ−1)∤n.
•
The second category of constructions of optimal (r,δ)-LRCs consists of codes with fixed minimum distance d. In this case, the minimum distance d is less flexible, and the relative minimum distance d/n vanishes as the code length n tends to infinity.
Notably, some constructions in this category achieve super-linear code lengths with respect to the field size q. Moreover, certain constructions even attain unbounded code length when d≤2δ.
As shown in [16, Theorem 10] and [18, Theorem 2], the length of a q-ary optimal (r,δ)-LRC with minimum distance d>2δ
is upper bounded by O(qCd,r,δ), where Cd,r,δ is a constant depending only on d, r and δ.
Constructions in this category are usually derived using parity-check matrix approaches combined with combinatorial tools, as in [16, 19, 20, 18, 21, 22, 23, 24, 25].
In addition, some constructions are obtained using cyclic codes and constacyclic codes, such as those in [26, 27, 28].
Apart from these two main categories, there also exist several interesting constructions that do not fall neatly into either one, e.g., [29, 30, 31]. We do not go into details.
To facilitate comparison, we summarize the aforementioned first category of constructions of
optimal (r,δ)-LRCs, namely, those with flexible minimum distances, in Table I. Row 15 is marked with a superscript ∗ to indicate that the corresponding construction is either optimal or almost optimal. We remark that the constructions in [7] by Jin et al. were originally presented as r-LRCs, but they can be naturally generalized to the case of (r,δ)-LRCs, as indicated in Rows 1 and 2 of Table I. Some of our new constructions are also listed in Table I and will be discussed in detail in the next subsection.
I-B Our Motivations and Contributions
As shown in Table I, there have been several constructions of optimal r-LRCs (i.e., (r,δ=2)-LRCs) with flexible minimum distances and lengths exceeding q+1 (see Rows 4-7, 10, 13).
It is worth noting that there is only one known construction of optimal (r,δ)-LRCs (δ≥3) with code length exceeding q+1 (see Row 3 of Table I). However, this construction has a drawback: its code length depends on δ. When δ is fixed, the resulting code length exceeds q+1 by only a constant. These facts motivate us to consider the construction of long optimal (r,δ)-LRCs with flexible minimum distances, especially for δ≥3. Naturally, we begin to consider whether the elliptic function field-based constructions of optimal r-LRCs proposed by Li et al. [8] and by Ma and Xing [9] can be extended to the general optimal (r,δ)-LRCs. We find that, unlike the constructions based on polynomials and rational function fields in [3] and [7], the generalization of elliptic function field-based constructions in [8, 9] from r-LRCs to (r,δ)-LRCs is not straightforward. For further details, see Section III-A, especially Remark III.1 (i). Therefore, we turn our attention to the problem of constructing long optimal (r,δ)-LRCs with δ≥3 and flexible minimum distances, using elliptic function fields or more generally, algebraic function fields of higher genus. Our main contributions are organized into the following three parts.
•
By utilizing the abelian group structure of elliptic curves, we generalize the framework for constructing optimal r-LRCs via automorphism groups of elliptic function fields in [8, 9] to the case of (r,δ)-LRCs in Propositions III.1 and III.2.
Later in Theorems III.1 and III.2, we propose two distinct sufficient conditions for elliptic function fields and subgroups of their automorphism groups, under which we can obtain constructions of optimal (r,3)-LRCs and (2,δ)-LRCs by the generalized framework described above. By selecting suitable explicit elliptic function fields and their automorphism subgroups, we obtain several classes of explicit optimal (r,3)-LRCs and (2,δ)-LRCs with lengths slightly less than q+2q. Their parameters are outlined in Rows 8, 9, 11, 12, 14 of Table I.
•
Inspired by the constructions of either optimal or almost optimal r-LRCs via automorphism groups of hyperelliptic function fields of genus 2 proposed by Huang and Zhao [17], we develop a general framework for constructing optimal (r,3)-LRCs via automorphism groups of such hyperelliptic function fields, as presented in Propositions IV.1 and IV.2. By applying this framework to specific hyperelliptic function fields, we arrive at a family of explicit optimal (4,3)-LRCs with length slightly below q+4q. We then further consider the construction of optimal (r,δ)-LRCs via hyperelliptic function fields of genus g≥2, obtaining optimal (g+1−g′,g+1+g′)-LRCs (0≤g′≤g−1) with length q+2gq in Theorem IV.2. Their parameters are outlined in Rows 16–19 of Table I.
•
We propose a framework for constructing optimal (r,δ)-LRCs via superelliptic curves in Proposition V.1, and obtain several classes of explicit constructions based on it. Their parameters are partially listed in Rows 20–25 of Table I. Specifically, as shown in Rows 22 and 23 of Table I, over Fq=Fqs with s≥2, Theorem V.1 produces q-ary optimal (r,δ)-LRCs with lengths up to bq1q2+bqb−1q and qcq(q−1), respectively.
In Theorem V.2 (i), we generalize Theorem IV.2 (i), yielding optimal (r,δ)-LRCs with longer code lengths for smaller value of r (with (r+δ−1) fixed); moreover, it can be carried out over fields of even characteristic (see Remark V.3).
It is evident from Table I that many of our new optimal (r,δ)-LRCs have the longest lengths among existing constructions of optimal (r,δ)-LRCs with flexible minimum distances.
I-C Organization of This Paper
The rest of the paper is organized as follows.
In Section II, we review some preliminaries for
this paper, including algebraic function fields, algebraic geometry codes, extension theory of algebraic function fields, elliptic function fields and hyperelliptic function fields, along with their automorphism groups.
In Section III, we present a general framework for constructing optimal (r,δ)-LRCs via automorphism groups of elliptic function fields.
Based on this framework, we construct two distinct classes of optimal (r,3)-LRCs and (2,δ)-LRCs with lengths slightly below q+2q.
In Section IV, using the automorphism subgroups of hyperelliptic function fields of genus 2, we obtain optimal (4,3)-LRCs with lengths slightly below q+4q.
Optimal (g+1−g′,g+1+g′)-LRCs (0≤g′≤g−1) via hyperelliptic curves of genus g≥2 are also presented.
In Section V, we introduce a general framework for constructing optimal (r,δ)-LRCs via superelliptic curves. Based on it, we present two classes of explicit constructions with large code lengths.
Section VI concludes the paper.
II Preliminaries
In this section, we present some preliminaries on algebraic function fields, algebraic geometry codes, extension theory of function fields, elliptic function fields and hyperelliptic function fields, as well as their automorphism groups.
For omitted details, the reader is referred to [32, 33, 34], [8], [9], [35, 36, 37], [17].
II-A Algebraic Function Fields and Algebraic Geometry Codes
Let E/Fq be a function field of genus g(E) with the full constant field Fq.
Let PE denote the set of all places of E, and let PE1 denote the set of all rational places of E.
The free abelian group generated by PE is called the divisor group of E/Fq and is denoted by Div(E).
For w∈E∗=E\{0}, its principal divisor is defined by
[TABLE]
where vP is the normalized discrete valuation with respect to the place P.
For D∈Div(E), the Riemann-Roch space
[TABLE]
is a finite-dimensional vector space over Fq. We denote its dimension by ℓ(D):=dimFqL(D), which is at least deg(D)+1−g(E) by Riemann’s theorem (see [33, Theorem 1.4.17]). If deg(D)≥2g(E)−1, then it holds
[TABLE]
by the Riemann-Roch theorem (see [33, Theorem 1.5.15]).
When dealing with multiple function fields, we use superscripts and subscripts to indicate the underlying function field of the principal divisors and the Riemann-Roch spaces, respectively. For example, we write (w)E instead of (w), and write LE(D) instead of L(D).
Let P={P1,…,Pn} be a set of n distinct rational places of E, which will be used for evaluation. For a divisor D of E with 0≤deg(D)<n and supp(D)∩P=∅, the algebraic geometry code associated with P and D is defined to be
[TABLE]
Then C(P,D) is a linear code with dimension ℓ(D) and minimum distance at least n−deg(D).
For any subspace V of LE(D), we define a (linear) subcode of C(P,D) by
[TABLE]
Consequently, C(P,V) is an [n,k,d]q-linear code with dimension k=dimFq(V), and its minimum distance d remains at least n−deg(D).
II-B Extension Theory of Function Fields
Let E/Fq be a function field with the full constant field Fq and let F be a subfield of E with the same full constant field Fq such that E/F is a finite separable extension. For any place P of E and place Q of F such that P lies over Q, we use e(P∣Q),f(P∣Q), and d(P∣Q) to denote the ramification index, relative degree, and different exponent of P over Q, respectively. By Dedekind’s different theorem (see [33, Theorem 3.5.1]), it holds
[TABLE]
For a place Q of F, its conorm (with respect to E/F) is defined to be
[TABLE]
where the sum runs over all places P∈PE lying over Q.
The different divisor of E/F is defined to be
Diff(E/F):=∑Q∈PF∑P∣Qd(P∣Q)P∈Div(E).
Let g(E) and g(F) denote the genus of E and F, respectively.
Then the Hurwitz genus formula (see [33, Theorem 3.4.13]) yields
[TABLE]
So far, we have assumed that E/F is a finite separable extension and recalled some known results. We now consider a more specific setting of F to facilitate the later constructions (F=EG, see below). Let G be a finite subgroup of Aut(E/Fq):={σ:σ is an Fq-automorphism of E}. The subfield of elements of E fixed by G is defined by
[TABLE]
From the Galois theory, E/EG is a Galois extension with Gal(E/EG)=G.
By [33, Lemma 3.5.2], for any automorphism σ∈Gal(E/EG)=G and any place P∈PE, σ(P):={σ(u):u∈P} is still a place of E.
Moreover, if P lies over Q∈PEG, then σ(P) also lies over Q. By [33, Theorem 3.7.1 and Corollary 3.7.2], which characterize Galois extensions of function fields, the following result holds.
Lemma II.1** ([33, Theorem 3.7.1 and Corollary 3.7.2]).**
Maintaining the above setting. Let Q be a place of EG, and let P1,P2,…,Pn be all the distinct places of E lying over Q. Then the following statements hold.
(i)
The Galois group Gal(E/EG)=G acts transitively on the set {P1,…,Pn}.
(ii)
e(P1∣Q)=⋯=e(Pn∣Q), f(P1∣Q)=⋯=f(Pn∣Q), and d(P1∣Q)=⋯=d(Pn∣Q).
(iii)
n⋅e(Pi∣Q)f(Pi∣Q)=[E:EG]=∣G∣* for any 1≤i≤n.*
Remark II.1**.**
Lemma II.1 implies the following two useful facts.
(i)
For any P∈PE, P∩EG splits completely in E/EG if and only if the places σ(P), for all σ∈G, are pairwise distinct.
(ii)
For any rational place P of E, the rational place P∩EG splits completely in E/EG if and only if e(P∣P∩EG)=1.
In this paper, we always hope that the subfield EG of E can be determined to be a rational function field over Fq. Thus, the following necessary and sufficient condition will be useful.
Lemma II.2**.**
Maintaining the above setting. EG is a rational function field if and only if degDiff(E/EG)>2g(E)−2.
Proof.
We have 2g(E)−2=(2g(EG)−2)[E:EG]+degDiff(E/EG) by the Hurwitz genus formula (see (6)). Hence, degDiff(E/EG)>2g(E)−2 if and only if g(EG)=0. This is equivalent to EG being a rational function field by [33, Proposition 1.6.3, Eq. (5.3) and Corollary 5.1.11].
∎
II-C Elliptic Curves and Elliptic Function Fields
Throughout this paper, a curve is by default referred to as a projective, smooth, and absolutely irreducible algebraic curve.
In particular, an elliptic curve E over Fq is defined by a nonsingular Weierstrass equation
[TABLE]
where ai are elements of Fq. The genus of E is 1.
An elliptic curve over Fq is also denoted by a pair (E,O), where E is the curve defined by the above Weierstrass equation (7), and O is the point at infinity of E. Denote by E/Fq and E(Fq) the function field of E/Fq and the set of all rational points on E/Fq, respectively. The function field E is given by E=Fq(x,y), where transcendent elements x and y satisfy the above Weierstrass equation (7). Recall that PE1 denotes the set of rational places of E. There is a natural bijection between E(Fq) and PE1. Specifically, a rational point (α,β) corresponds to the unique common zero of x−α and y−β; and the point at infinity O corresponds to the unique common pole of x and y, which will still be denoted by O.
The set of all rational points E(Fq) has a natural
structure of abelian group (E(Fq),⊕) with zero element O given by the
chord-tangent group law (see [34, Chapter III.2]).
We now identify PE1 with the abelian group E(Fq) via the bijection described above. This means that PE1 is also an abelian group with zero element O, and we continue to use the symbol ⊕ for its addition. Moreover, for P∈PE1, we use ⊖P to denote its inverse, and for P,Q∈PE1, we use P⊖Q to represent P⊕(⊖Q), i.e, the subtraction. We also write [m]P to stand for
[TABLE]
In what follows, we review the correspondence between the geometric group law of PE1 and the algebraic group law of Cl0(E).
The set of divisors of degree zero forms a subgroup of Div(E), denoted by Div0(E).
Two divisors A,B∈Div(E) are called equivalent if there exists w∈E∗ such that A=B+(w), and we denote this by A∼B.
The set of divisors
Princ(E):={(w)E=∑P∈PEvP(w)P:w∈E∗} is called the group of principal divisors of E/Fq, which is a subgroup of the abelian group Div0(E).
The group of divisor classes of degree zero of E/Fq is defined as the following quotient group
[TABLE]
By [34, Chapter III, Proposition 3.4 (e)], there is a group isomorphism between (PE1,⊕)≅(E(Fq),⊕) and Cl0(E) given by
[TABLE]
where [P−O] denotes P−O+Princ(E)∈Cl0(E)=Div0(E)/Princ(E).
This implies the following lemma.
Lemma II.3**.**
Let E/Fq be an elliptic function field and let P1,…,Pn,P1′,…,Pn′ be 2n (not necessarily distinct) rational places of E. Then
[TABLE]
Proof.
We have
P1+⋯+Pn∼P1′+⋯+Pn′ if and only if
P1−O+⋯+Pn−O∼P1′−O+⋯+Pn′−O, which is equivalent to
[P1−O]+⋯+[Pn−O]=[P1′−O]+⋯+[Pn′−O].
This is equivalent to P1⊕⋯⊕Pn=P1′⊕⋯⊕Pn′ by the group isomorphism φ in (8).
∎
There is an upper bound on the number N(E)=∣PE1∣=∣E(Fq)∣, which is the special case of the well-known Hasse–Weil bound for curves of genus 1 (see [34, Chapter V.1, Theorem 1.1]). It states that
∣N(E)−q−1∣≤2q.
An elliptic function field E/Fq is called maximal if N(E) attains the Hasse-Weil upper bound, i.e.,
N(E)=q+2q+1.
We now recall some results on N(E) and the group structure of (PE1,⊕)≅(E(Fq),⊕).
We say that two elliptic curves E1 and E2 over Fq are isogenous if there is a non-constant smooth Fq-morphism from E1 to E2 that sends the zero of E1 to the zero of E2 (see [34]). It is well known that two elliptic curves E1 and E2 over Fq are isogenous if and only if they have the same number of rational points. The following precise result is due to [38].
The isogeny classes of elliptic curves over Fq for q=ps are in one-to-one correspondence with the rational integers t having ∣t∣≤2q
and satisfying some one of the following conditions:
(i)
(t,p)=1;
(ii)
If s is even: t=±2q;
(iii)
If s is even and p≡1(mod3): t=±q;
(iv)
If s is odd and p=2 or 3: t=±p2s+1;
(v)
If either (1)s is odd or (2)s is even and p≡1(mod4):t=0.
Furthermore, an elliptic curve in the isogeny class corresponding to t has q+1+t rational points.
As for the group structure of (PE1,⊕)≅(E(Fq),⊕), the following result can be found in [39, Theorem 3] and [40, Theorem 9.97], which is summarized by Ma and Xing in [9, Proposition 2.4].
Lemma II.5**.**
Let Fq be the finite field with q=ps elements. Let h=∏ℓℓhℓ be a possible number of rational places of an elliptic function field E over Fq. Then all the possible groups PE1 are
Z/phpZ×∏ℓ=p(Z/ℓaℓZ×Z/ℓhℓ−aℓZ)
with
(a)
In case (ii) of Lemma II.4: Each aℓ is equal to hℓ/2, i.e, PE1≅Z/(q±1)Z×Z/(q±1)Z.
(b)
In other cases of Lemma II.4: aℓ is an arbitrary integer satisfying 0≤aℓ≤min{νℓ(q−1),[hℓ/2]}.
In cases (iii) and (iv) of Lemma II.4: PE1≅Z/hZ.
In case (v) of Lemma II.4: if q≡−1(mod 4), then PE1≅Z/(q+1)Z; otherwise, PE1≅Z/(q+1)Z or PE1≅Z/2Z×Z/2q+1Z.
II-D Automorphism Groups of Elliptic Curves and Elliptic Function Fields
First, we review the automorphism groups of elliptic curves.
Let E/Fq be an elliptic curve defined by the Weierstrass equation (7). We denote by Aut(E) the set of automorphisms of the elliptic curve E over the algebraic closure Fq. We emphasize that every automorphism σ∈Aut(E) is required to fix the point at infinity O, that is, it must be an isogeny. For a characterization of Aut(E), see [34, Chapter III, Theorem 10.1] and its proof.
Next, we review the automorphism groups of elliptic function fields.
Let E/Fq be the function field of E/Fq.
Define
Aut(E/Fq):={σ:σ is an Fq-automorphism of E}.
It is a subgroup of the automorphism group Aut(EFq/Fq).
For σ∈Aut(E/Fq) and P∈PE, it follows from the proof of [33, Lemma 3.5.2 (a)] that σ(P) is also a place of E.
Let Aut(E,O):={σ∈Aut(E/Fq):σ(O)=O} be the set of Fq-automorphisms of E fixing O.
Then Aut(E,O) is a subgroup of Aut(E) in which every automorphism is defined over Fq, i.e., it holds that Aut(E,O)=Aut(E)∩Aut(E/Fq).
For each Q∈PE1, the translation-by-Q map
τQ defined by τQ(P)=P⊕Q induces an Fq-automorphism of E. Let TE be the translation group {τQ:Q∈PE1} of the elliptic function field E, which is naturally isomorphic to the abelian group PE1. The following two results characterize the automorphism group of an elliptic function field and its subgroups.
Let E/Fq be an elliptic function field. The automorphism group of E over Fq is the semidirect product of the translation group TE and the stabilizer Aut(E,O) of the infinite place O, i.e.,
[TABLE]
The group law of Aut(E/Fq) is given by (τPα)⋅(τQβ)=τP⊕α(Q)⋅αβ for any τP,τQ∈TE and α,β∈Aut(E,O).
Let E/Fq be an elliptic function field and let G be a subgroup of Aut(E/Fq). Then, we have G≅(TE∩G)⋊π(G), i.e., every subgroup of Aut(E/Fq) is isomorphic to a semiproduct of a subgroup of TE and a subgroup of Aut(E,O).
Conversely, given
a subgroup T of TE and a subgroup A of Aut(E,O), one may wonder under what conditions the product TA is a subgroup of Aut(E/Fq). The following lemma provides a useful necessary and sufficient condition.
Let T be a subgroup of the translation group TE and let A be a subgroup of Aut(E,O).
Then TA is a subgroup of Aut(E/Fq) if and only if τσ−1(Q)∈T for all σ∈A and τQ∈T.
By the isomorphism between TE and PE1, any subgroup T of TE can be written as T=TH:={τQ:Q∈H} for some subgroup H of PE1. In the rest of the paper, we always adopt the symbol TH, as several arguments will require explicit computations with H. With this notation, the above lemma is restated as follows.
Lemma II.9** (Restatement of [9, Proposition 3.3]).**
Let H be a subgroup of PE1 and let A be a subgroup of Aut(E,O).
Then THA is a subgroup of Aut(E/Fq) if and only if σ(Q)∈H for all σ∈A and Q∈H.
We end this subsection with two facts, which will be applied in Section III. They can be found in [34, Chapter III, Theorem 3.6 and its proof, Theorem 4.8] and [9, Proposition 4.5].
Remark II.2**.**
Let E/Fq be an elliptic function field defined by the Weierstrass equation (7). Then the following hold.
(i)
There always exists an
element of order 2 in Aut(E,O) induced by the inversion operation in the group law of PE1, which is known as the elliptic involution. It can be explicitly defined by its action on x and y as (x↦x,y↦−y−a1x−a3).
With slight abuse of notation, we denote this automorphism by [−1]. For any subgroup H≤PE1, it holds σ(Q)∈H for all σ∈A:=⟨[−1]⟩={[−1],id} and Q∈H, which implies that TH⟨[−1]⟩ is a subgroup of Aut(E/Fq) by Lemma II.9.
(ii)
Any σ∈Aut(E,O) is an endomorphism (actually, an isomorphism) of the group (PE1,⊕), and, in particular, commutes with the above-mentioned elliptic involution [−1]∈Aut(E,O).
II-E Hyperelliptic Curves and Hyperelliptic Function Fields
Let Fq be a finite field of odd characteristic. A hyperelliptic curve C/Fq of genus g≥2 over Fq is a projective, smooth, absolutely irreducible curve defined by the following equation
[TABLE]
where f(x)∈Fq[x] is a square-free polynomial of degree 2g+1 or 2g+2. It has one or two rational points at infinity, depending on whether the degree of the polynomial f(x) is odd or even. In this paper, for hyperelliptic curves, we will only consider the case deg(f(x))=2g+1, in which case there is exactly one rational point at infinity, denoted by P∞.
Let E/Fq denote the function field of C/Fq, and let C(Fq) denote the set of rational points on C/Fq. The function field E is given by E=Fq(x,y), where the transcendent elements x and y satisfy the equation (9). There is a one-to-one correspondence between C(Fq) and PE1. Specifically, the rational point (α,β) on C/Fq corresponds to the unique common zero of x−α and y−β, which we denote by P(α,β). The point at infinity P∞ corresponds to the unique common pole of x and y, which we also denote by P∞. Throughout this paper, rational points and rational places not at infinity are called affine rational points and affine rational places, respectively.
Given an affine rational point (α,β)∈C(Fq), its hyperelliptic conjugate (α,−β) also lies on C/Fq and corresponds to the unique common zero of x−α and y+β, which we denote by P(α,β):=P(α,−β)∈PE1.
For a divisor ∑i=1gPi∈Div(E) with P1,…,Pg∈PE1, we say that its affine part is reduced if Pi=Pj for any 1≤i=j≤g such that Pi and Pj are affine rational places.
Based on this definition, we have the following corollary derived from [41, Proposition 1].
It will be applied in Section IV-B in the special case g=2.
Lemma II.10**.**
Let q be an odd prime power, and let E/Fq be a hyperelliptic function field of genus g≥2 defined by the equation (9) with deg(f(x))=2g+1.
Let D0=∑i=1gPi and D0′=∑i=1gPi′ be two effective divisors whose affine parts are reduced, where P1,…,Pg,P1′,…,Pg′∈PE1. If D0∼D0′, then we have D0=D0′.
Proof.
Let D∞:=gP∞∈Div(E). Since D0∼D0′, we have [D0−D∞]=[D0′−D∞]∈Cl0(E). By the uniqueness of the representative described in [41, Proposition 1], we have
D0=D0′.
∎
Let C be an arbitrary curve of genus g≥0 defined over an arbitrary finite field Fq, and let E/Fq be its function field. The Hasse–Weil bound [33, Theorem. 5.2.3] provides a bound on
N(E):=∣PE1∣=∣C(Fq)∣.
Lemma II.11**.**
Let N(E) be defined as above. Then we have the following Hasse–Weil bound
[TABLE]
A curve C/Fq and its function field E/Fq are called maximal (minimal, respectively) if N(E)=q+1+2gq (if N(E)=q+1−2gq, respectively).
The following result is well known.
Lemma II.12**.**
Assume that q is a square and C is a curve of genus g≥1 over Fq.
If C/Fq is maximal, then C is maximal over Fqs if and only if s is odd. Furthermore, C is minimal over Fqs if and only if s is even.
Proof.
Since C/Fq is maximal, its L-polynomial is L(C/Fq,T)=1+2gqT+(higher order terms of T)=∏i=12g(1−αiqT) with ∣αi∣=1 by [33, Theorem 5.1.15]. Thus, α1=⋯=α2g=−1 and the L-polynomial over Fqs is L(C/Fqs,T)=(1−(−q)sT)2g by [33, Theorem 5.1.15]. Since C is maximal (minimal, respectively) over Fqs if and only if its L-polynomial is (1+qs/2T)2g ((1−qs/2T)2g, respectively), this lemma is proved.
∎
The following two classes of hyperelliptic curves will be useful in our later constructions.
Let q be an odd prime power. The smooth complete hyperelliptic curve C corresponding to
y2=x2g+1+x
is maximal over Fq2 if and only if q≡−1 or 2g+1(mod4g).
Let q be an odd prime power. The smooth complete hyperelliptic curve C corresponding to
y2=x2g+1+1
is maximal over Fq2 if and only if 2g+1 divides q+1.
II-F Automorphism Groups of Hyperelliptic Curves and Hyperelliptic Function Fields of Genus 2
Every automorphism of a hyperelliptic curve C of genus 2 is given by
[TABLE]
associated with a uniquely determined matrix
Mσ=(acbd)∈GL2(Fq).
We use Aut(C) to denote the automorphism group of C over Fq. It is isomorphic to a finite subgroup of GL2(Fq). For a hyperelliptic curve C of genus 2 defined over Fq, we say that an automorphism σ∈Aut(C) is defined over Fq if
its associated matrix Mσ is in GL2(Fq).
We denote Aut(C/Fq):={σ∈Aut(C):σ is defined over Fq}, which is a subgroup of Aut(C). For each σ∈Aut(C/Fq), it naturally induces an Fq-automorphism of the function field E/Fq=Fq(C), which will also be denoted by σ for a little abuse of notations. Actually, this gives a one-to-one correspondence between Aut(C/Fq) and Aut(E/Fq). Sometimes, we do not distinguish between them.
Every hyperelliptic curve admits a special automorphism ι of order 2, which is known as the hyperelliptic involution.
Remark II.3**.**
Let C be a hyperelliptic curve of genus 2 defined over Fq (char(Fq)=2) by the equation y2=f(x), and let E/Fq be its function field. There exists a special automorphism, the hyperelliptic involution ι∈Aut(C/Fq)=Aut(E/Fq), defined by
ι:(x↦x,y↦−y),
with associated matrix M_{\iota}=\left(\begin{array}[]{cc}-1&0\\
0&-1\end{array}\right). It commutes with all elements in Aut(C/Fq)=Aut(E/Fq) since Mι is a scalar matrix. Moreover, it holds ι(P(α,β))=P(α,β) for any affine rational place P(α,β)∈PE1.
There have been many studies on the automorphism group of hyperelliptic curves of genus 2. For example, [35, 36, 37].
Based on the results in [36, 37], Huang and Zhao [17] determined the automorphism group of the hyperelliptic curve defined by y2=x5+x over particular finite fields, which is helpful for our calculations later in Section IV-B.
Let q be a power of an odd prime such that 8∣(q−1) and 21/2∈Fq. Let C be a hyperelliptic curve defined over Fq by the equation y2=x5+x. Let S~4 and S~5 denote certain 2-coverings of the permutation groups S4 and S5, respectively. Then the following statements hold.
(i)
If char(Fq)=3,5, then Aut(C/Fq)≃S~4.
Specifically, Aut(C/Fq)≅<U′,V′>≤GL2(Fq) with
[TABLE]
(ii)
If char(Fq)=5, then Aut(C/Fq)≃S~5.
Specifically, Aut(C/Fq)≅<U′,V′,W′>≤GL2(Fq) with
[TABLE]
III Constructions of Optimal (r,δ)-LRCs via Automorphism Groups of Elliptic Function Fields
III-A A General Framework for Constructing Optimal (r,δ)-LRCs via Automorphism Groups of Elliptic Function Fields
In this subsection, we present a general framework for constructing optimal (r,δ)-LRCs via automorphism groups of elliptic function fields, which is a generalization of that proposed in the works [8] and [9].
We transform the construction of optimal (r,δ)-LRCs based on automorphism groups of elliptic function fields into some conditions concerning the group law of PE1 (see Section II-C).
Before proceeding, recall that for any H≤PE1, we denote by TH the subgroup {τQ:Q∈H} of the translation group TE.
Proposition III.1**.**
Let E/Fq be an elliptic function field.
Let H be a subgroup of PE1 and let A be a nontrivial subgroup of Aut(E,O) such that G=THA is a
subgroup of Aut(E/Fq) (see Lemma II.9). Let ∣G∣=r+δ−1 with r≥1,δ≥2.
Let F:=EG, and let [P1,P2,…,Pr+δ−1] be a list222Here, a list refers to an ordered multiset of rational places of E, or equivalently, a finite sequence of (not necessarily distinct) rational places of E. of rational places of E such that ∑j=1r+δ−1Pj=ConE/F(Q∞) for a rational place Q∞∈PF1. Then the following statements hold.
(i)
There exists a function z∈F such that F=Fq(z) and (z)∞E=ConE/F(Q∞)=∑j=1r+δ−1Pj.
(ii)
The set LE(∑j=1i+1Pj)\LE(∑j=1iPj) is non-empty for each 1≤i≤r−1.
Moreover, let wi be an arbitrary element of LE(∑j=1i+1Pj)\LE(∑j=1iPj) for each 1≤i≤r−1. Then w0:=1,w1,…,wr−1 are linearly independent over F.
(iii)
Let {Pi,1,Pi,2,…,Pi,r+δ−1} be pairwise distinct rational places of E lying over a rational place Qi of F for each 1≤i≤ℓ, such that Q∞,Q1,…,Qℓ are pairwise distinct.
Then all r×r submatrices of the following matrix
[TABLE]
are invertible for each 1≤i≤ℓ if and only if
[TABLE]
or equivalently,
[TABLE]
Proof.
(i) By Lemma II.1 (i), the set of all distinct places of E lying over O∩F is {σ(O):σ∈THA}=H. Since O is a rational place, we have f(O∣O∩F)=1. Applying Lemma II.1 (iii) yields ∣H∣⋅e(O∣O∩F)=∣G∣=∣A∣∣H∣, and hence, e(O∣O∩F)=∣A∣≥2.
By Dedekind’s different theorem (see (5)), we have degDiff(E/F)≥deg((e(O∣O∩F)−1)O)≥1. By Lemma II.2, F is a rational function
field. Therefore, we have dimFq(LF(Q∞))=2. Let z∈LF(Q∞)\Fq. We have [F:Fq(z)]=deg((z)∞F)=deg(Q∞)=1 and (z)∞E=ConE/F((z)∞F)=ConE/F(Q∞)=∑j=1r+δ−1Pj.
(ii) Since the case r=1 is trivial, we henceforth assume r≥2.
By the Riemann-Roch theorem (see (2)), for any 1≤i≤r−1, we have LE(∑j=1i+1Pj)\LE(∑j=1iPj)=∅.
Let w0:=1 and wi∈LE(∑j=1i+1Pj)\LE(∑j=1iPj) for each 1≤i≤r−1.
We need to show that w0,w1,…,wr−1 are F-linearly independent. Assume towards a contradiction that there exist rational functions f0(z),…,fr−1(z)∈F=Fq(z), not all zero, such that ∑i=0r−1fi(z)wi=0. By clearing denominators, we may assume that f0(z),…,fr−1(z) are polynomials of z.
Let t:=max{0≤i≤r−1:deg(fi(z))=max{deg(fj(z)):0≤j≤r−1}}, where we adopt the convention deg(0):=−∞. It holds that ft(z)=0. Then we consider the following two possible cases of t towards deriving a contradiction. Before proceeding, we denote e:=e(P1∣Q∞)=⋯=e(Pr+δ−1∣Q∞), and observe that vP1(z)=⋯=vPr+δ−1(z)=−e.
•
If t=0, then we have deg(f0(z))>deg(fi(z)) for any 1≤i≤r−1. Hence, for any 1≤i≤r−1 such that fi(z)=0, we have
[TABLE]
where the symbol “≤” is due to wi∈LE(P1+⋯+Pr+δ−1−Pr+δ−1)=LE(∑P∣Q∞eP−Pr+δ−1). This implies vPr+δ−1(∑i=0r−1fi(z)wi)=vPr+δ−1(f0(z)w0)=∞ by the strict triangle inequality (see [33, Lemma 1.1.11]).
•
If 1≤t≤r−1, then we have deg(ft(z))≥deg(fi(z)) for any 0≤i≤t−1; and deg(ft(z))>deg(fi(z)) for any t+1≤i≤r−1.
Hence, for any 0≤i≤t−1 such that fi(z)=0, we have
[TABLE]
where “<” is due to deg(ft(z))≥deg(fi(z)) and vPt+1(wt)<vPt+1(wi) since vPt+1(wt)≤−vPt+1(∑j=1t+1Pj),333This inequality holds because otherwise we would have wt∈LE(∑j=1tPj), contradicting the fact that wt∈LE(∑j=1t+1Pj)\LE(∑j=1tPj). wi∈LE(∑j=1t+1Pj−Pt+1); and for any t+1≤i≤r−1 such that fi(z)=0, we have
[TABLE]
where the symbol “<” is due to deg(ft(z))>deg(fi(z)), vPt+1(wt)≤−1 and vPt+1(wi)≥−e since vPt+1(wt)≤−vPt+1(∑j=1t+1Pj) and wi∈LE(∑j=1r+δ−1Pj)=LE(∑P∣Q∞eP).
Inequalities (19) and (20) imply vPt+1(∑i=0r−1fi(z)wi)=vPt+1(ft(z)wt)=∞.
The above two cases both lead to a contradiction with ∑i=0r−1fi(z)wi=0.
Therefore, w0,w1,…,wr−1 are F-linearly independent.
(iii) For any 1≤i≤ℓ and 1≤u1<⋯<ur≤r+δ−1, we will show that the submatrix consisting of the u1,…,ur-th columns of Mi in (16)
is singular if and only if ⊕j=1rPj=⊕j=1rPi,uj.
If the submatrix consisting of the u1,…,ur-th columns of Mi is singular, then there exist c0,c1,…,cr−1∈Fq, not all zero, such that the vector (c0,c1,…,cr−1)Mi vanishes at the positions u1,…,ur. Thus, the function w:=∑j=0r−1cjwj has r zeros Pi,u1,…,Pi,ur. Since w∈LE(P1+⋯+Pr), we have w∈LE(P1+⋯+Pr−Pi,u1−⋯−Pi,ur). This implies (w)E=−P1−⋯−Pr+Pi,u1+⋯+Pi,ur. And then it holds ⊕j=1rPj=⊕j=1rPi,uj by Lemma II.3.
Conversely, ⊕j=1rPj=⊕j=1rPi,uj implies P1+⋯+Pr∼Pi,u1+⋯+Pi,ur by Lemma II.3, i.e., there exists a nonzero function w∈E such that (w)E=−P1−⋯−Pr+Pi,u1+⋯+Pi,ur. Then we have w∈LE(∑j=1rPj)=spanFq{w0,w1,…,wr−1}, and thus w=∑j=0r−1cjwj for some c0,c1,…,cr−1∈Fq that are not all zero, which means that (c0,c1,…,cr−1)Mi vanishes at the positions u1,…,ur. And then the submatrix consisting of the u1,…,ur-th columns of Mi is singular.
The above statements imply the equivalences stated in Proposition III.1 (iii), except for (18). It remains to establish the equivalence between (18) and (17).
Note that for any 1≤i≤ℓ, LF(Q∞−Qi)={0} since F is a rational function field. Thus, there exists a nonzero function z′∈LF(Q∞−Qi)⊆F such that (z′)F=−Q∞+Qi, and then (z′)E=ConE/F((z′)F)=ConE/F(−Q∞+Qi)=(−P1−⋯−Pr+δ−1)+(Pi,1+⋯+Pi,r+δ−1). This implies that ⊕j=1r+δ−1Pj=⊕j=1r+δ−1Pi,j by Lemma II.3.
Therefore,
[TABLE]
is equivalent to
[TABLE]
Consequently, (18) and (17) are equivalent. The proof is completed.
∎
Remark III.1**.**
(i)
In Proposition III.1, when δ=2, the equivalent condition (18) becomes
[TABLE]
This condition holds naturally due to the fact that Pr+1=Pi,j for any 1≤i≤ℓ and 1≤j≤r+1. And thus all r×r submatrices of Mi in (16) are invertible for each 1≤i≤ℓ.
This is exactly what is demonstrated in **[9, Proposition 4.2 (iii)]**, where all r×r submatrices of the following matrix
[TABLE]
are proved to be invertible for each 1≤i≤ℓ. However, when r>1 and δ>2, the conditions (17) and (18) are not guaranteed to hold without additional assumptions. Later, in Sections III-B and III-C, for r=2 or δ=3, we will provide two distinct sufficient conditions for an elliptic function field and the subgroups of its automorphism group, under which we can select rational places [P1,…,Pr+δ−1],{P1,1,…,P1,r+δ−1},…,{Pℓ,1,…,Pℓ,r+δ−1} satisfying conditions (17) and (18). This, together with Proposition III.2 below, leads to several classes of optimal (r,3)-LRCs and optimal (2,δ)-LRCs.
(ii)
In addition to generalizing the framework from the case of r-LRCs in **[9, Proposition 4.2]** to the case of (r,δ)-LRCs, Proposition III.1 also provides the following improvement. In **[9, Proposition 4.2]**, P1,…,Pr+1 are required to be all distinct rational places lying over a rational place Q∞∈PF1 that splits completely in E/F, and then the functions w0,w1,…,wr−1 are defined by the set {P1,…,Pr+1}. In Proposition III.1, we allow the functions w0,w1,…,wr−1 to be defined using a list [P1,…,Pr+δ−1] of rational places of E satisfying ∑j=1r+δ−1Pj=ConE/F(Q∞) for a rational place Q∞ of F, regardless of whether Q∞ splits completely in E/F. This improvement is crucial for our later construction of optimal (r,3)-LRCs (and (2,δ)-LRCs) in Theorem III.2. There, the elliptic involution [−1]∈/G≤Aut(E/Fq), and we need to select [P1,P2,…,Pr+2] such that
[TABLE]
which is fulfilled by setting Q∞=O∩F and Pr+1=Pr+2=O. However, it is hard to fulfill (21) if we require that Q∞ splits completely in E/F.
(iii)
Assume that for r=a, δ=b (with r+δ−1=a+b−1=∣G∣), there exist rational places [P1,P2,…,Pr+δ−1],{P1,1,…,P1,r+δ−1},…,{Pℓ,1,…,Pℓ,r+δ−1} satisfying the conditions in Proposition III.1, including conditions (17) and (18). Then for r=b−1,δ=a+1 (note that r+δ−1=a+b−1=∣G∣ still holds), there also exist rational places [P1′,P2′,…,Pr+δ−1′],{P1,1′,…,P1,r+δ−1′},…,{Pℓ,1′,…,Pℓ,r+δ−1′} satisfying the conditions in Proposition III.1, including conditions (17) and (18). Indeed, it suffices to set P1′=Pr+δ−1,…,Pr+δ−1′=P1, and Pi,j′=Pi,j for 1≤i≤ℓ and 1≤j≤r+δ−1.
Building directly on Proposition III.1, we have the following construction of optimal (r,δ)-LRCs.
Proposition III.2**.**
We adopt the settings of Proposition III.1 and assume that at least one of conditions (17) and (18) holds.
Suppose two integers t and m satisfy 1≤t<m≤ℓ. Let V:={a0,tw0zt+∑i=0r−1∑j=0t−1ai,jwizj:a0,t∈Fq and ai,j∈Fq for 0≤i≤r−1,0≤j≤t−1}, and let P:={P1,1,…,P1,r+δ−1,…,Pm,1,…,Pm,r+δ−1}. Define C(P,V) by
[TABLE]
Then the linear code C(P,V) is an optimal (r,δ)-LRC with parameters [m(r+δ−1),tr+1,(m−t)(r+δ−1)]q.
Proof.
By Proposition III.1 (ii), w0,w1,…,wr−1 are F-linearly independent, which, along with the fact that 1,z,…,zt∈F are Fq-linearly independent, implies that dimFq(V)=tr+1. Note that V⊆LE(t(P1+P2+⋯+Pr+δ−1)). By Section II-A, C(P,V) is a linear code with parameters
[n=m(r+δ−1),k=tr+1,d≥(m−t)(r+δ−1)]q.
In the following, we prove that C(P,V) is an optimal (r,δ)-LRC.
Since z∈F and Pi,1,…,Pi,r+δ−1 all lie over Qi∈PF1 for each 1≤i≤m, we have z(Pi,1)=⋯=z(Pi,r+δ−1)=z(Qi), and thus C(P,V)∣{(i−1)(r+δ−1)+1,…,i(r+δ−1)}={(ϕ(Pi,1),…,ϕ(Pi,r+δ−1)):ϕ∈spanFq{w0,w1,…,wr−1}}.
The minimum distance of C(P,V)∣{(i−1)(r+δ−1)+1,…,i(r+δ−1)} is equal to δ since the matrix Mi in (16) is a generator matrix of C(P,V)∣{(i−1)(r+δ−1)+1,…,i(r+δ−1)} and all r×r submatrices of Mi are invertible by Proposition III.1 (iii).
Thus, C(P,V) is an (r,δ)-LRC. By the Singleton-type bound (1), we have
d≤n−k+1−(⌈k/r⌉−1)(δ−1)=(m−t)(r+δ−1).
Therefore, the minimum distance d of C(P,V) is determined to be (m−t)(r+δ−1) and C(P,V) is an optimal (r,δ)-LRC.
∎
Remark III.2**.**
(i)
Ma and Xing (see the proof of **[9, Proposition 4.4]**) employed the modified algebraic geometry codes to lengthen the optimal r-LRC by (r+1), by allowing P1,…,Pr+1 to be evaluation points (where P1,…,Pr+1 are required to be pairwise distinct). Our framework (Proposition III.1 and Proposition III.2) can also achieve this (when δ=2, and P1,…,Pr+1 are pairwise distinct, or equivalently, Q∞ splits completely in E/F).
However, in general, or more precisely, in the case where δ≥3 and P1,…,Pr+δ−1 are pairwise distinct, the technique of modified algebraic geometry code may not be feasible, since the (r,δ)-locality can no longer be guaranteed on the extended evaluation points P1,…,Pr+δ−1.
(ii)
When δ=2, by **[9, Proposition 4.1]**, Proposition III.1, Remark III.1(i), Proposition III.2, and Remark III.2(i), we can recover **[9, Proposition 4.4]**. Alternatively, one can set δ=2 and Q∞=O∩F in Proposition III.1 and III.2 to recover **[9, Proposition 4.4]** by **[9, Proposition 4.1]** and Remark III.1(i).
As mentioned in Remark III.1 (i), when r≥2 and δ≥3, the conditions (17) and (18) will not hold by default like the case of r-LRCs (i.e., δ=2).
In the next two subsections, we consider specific settings of the elliptic function fields E/Fq along with suitable automorphism subgroups G=THA≤Aut(E/Fq), under which there exist rational places [P1,…,Pr+δ−1],{P1,1,…,P1,r+δ−1},…,{Pℓ,1,…,Pℓ,r+δ−1} satisfying conditions (17) and (18). Consequently, we arrive at several families of explicit optimal (r,3)-LRCs and (2,δ)-LRCs.
III-B Construction I of Optimal (r,3)-LRCs and (2,δ)-LRCs by the General Framework
In this subsection, we construct our first explicit family of optimal (r,3)-LRCs and (2,δ)-LRCs based on the framework proposed in the previous subsection. This class of constructions relies on elliptic function fields with odd rational places, utilizing a subgroup TH⟨[−1]⟩≤Aut(E/Fq).
Theorem III.1**.**
Let E/Fq be an elliptic function field with N(E) rational places satisfying 2∤N(E). Let H be a subgroup of PE1 of order h≥3, and let A:=⟨[−1]⟩≤Aut(E,O) (see Remark II.2(i)). Let G:=THA≤Aut(E/Fq), F:=EG, and r=2h−2, δ=3 (or r=2, δ=2h−1). Then there exist rational places [P1,…,Pr+δ−1], {P1,1,…,P1,r+δ−1},…,{Pℓ,1,…,Pℓ,r+δ−1} of E satisfying the conditions in Proposition III.1 (including conditions (17) and (18)), where ℓ=2hN(E)−h−1.
Consequently, by Propositions III.1 and III.2, there exist an optimal (r=2h−2,δ=3)-LRC and an optimal (r=2,δ=2h−1)-LRC with parameters
[m⋅2h,tr+1,(m−t)⋅2h]q
for any 1≤t<m≤ℓ=2hN(E)−h−1.
Proof.
It suffices to prove the case r=2h−2 and δ=3, from which the case r=2 and δ=2h−1 can be deduced by Remark III.1 (iii).
Let r=2h−2 and δ=3. In the following, we select rational places [P1,…,Pr+2], {P1,1,…,P1,r+2}, …, {Pℓ,1,…,Pℓ,r+2} of E that satisfy the conditions of Proposition III.1 (including the equivalent condition (18)).
To this end, we first consider the number of rational places of F that split completely in E/F. We claim that this number is equal to
[TABLE]
Indeed, the following two statements hold.
(1) for any P∈H, P∩F=O∩F does not split completely in E/F;
(2) for any P∈PE1\H, P∩F splits completely in E/F.
To prove the statement (1) where P∈H, it suffices to observe that ConE/F(O∩F)=∑R∈H2R by Lemma II.1. Consequently, e(P∣P∩F)=e(P∣O∩F)=2, and thus the statement (1) holds.
To prove the statement (2) where P∈PE1\H, we assume towards a contradiction that P∩F does not split completely in E/F. By Remark II.1 (i), this implies that σ1(P)=σ2(P) for some σ1=σ2∈G=TH⟨[−1]⟩, which further implies
[TABLE]
Let σ1−1σ2=τQ[−1]i for some Q∈H and i∈{0,1}. If i=0, then (24) implies that Q=O, which would mean σ1−1σ2=id, contradicting with σ1=σ2. Thus, i=1, and it follows that
[TABLE]
This implies [2]P=Q∈H, and then P=[N(E)+1]P=[2N(E)+1]([2]P)=[2N(E)+1]Q∈H, which contradicts P∈PE1\H. Therefore, the statement (2) holds, hence the number of rational places of F that split completely in E/F is exactly ℓ+1=2hN(E)−h.
We denote the sets of all rational places of E that lie over these ℓ+1 rational places of F by {P1,…,Pr+2},{P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2}, respectively.
We claim that there exists a reorder of P1,…,Pr+2 such that [P1,…,Pr+2],{P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2} satisfy the condition (18), i.e.,
[TABLE]
The proof of this claim is as follows. Since E/F=E/EG is a Galois extension with Gal(E/F)=G, the group G=TH⟨[−1]⟩ acts transitively on each of {P1,…,Pr+2},{P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2} by Lemma II.1 (i). Since the order of G is equal to r+2, which is equal to the cardinality of these sets, these pairwise disjoint sets can be represented as
[TABLE]
where P1⊕H denotes the coset {P1⊕Q:Q∈H}, and ⊔ denotes the union without intersection. We now prove that
and then we can choose two arbitrary distinct elements in P1⊕H⊆{P1,P2,…,Pr+2} to serve as new Pr+1, Pr+2 such that (25) holds.
Assume towards a contradiction that
[TABLE]
for some 1≤i≤ℓ. Then at least one of [2]P1⊖[2]Pi,1,[2]P1,[2]P1⊖[−2]Pi,1 is in H by the property of cosets. We consider them separately and derive a contradiction in each case.
•
[2]P1⊖[2]Pi,1∈H: In this case we have [2](P1⊖Pi,1)∈H, which implies that
[TABLE]
This leads to a contradiction with the fact that (P1⊕H)∩(Pi,1⊕H)=∅ by (26).
•
[2]P1∈H: In this case we have
[TABLE]
This leads to a contradiction with the fact that {P1,…,Pr+2}=(P1⊕H)⊔([−1]P1⊕H) is a set consisting of r+2=2h=2∣H∣ distinct rational places by (26).
•
[2]P1⊖[−2]Pi,1∈H: In this case we have [2](P1⊕Pi,1)∈H, which implies that
[TABLE]
This leads to a contradiction with the fact that (P1⊕H)∩([−1]Pi,1⊕H)=∅ by (26).
The claim is established, and therefore this theorem is proved.
∎
Remark III.3**.**
In the above proof, we determined the precise number of rational places of F that split completely in E/F: ℓ+1=2hN(E)−h (see (23) and its corresponding argument) under the conditions 2∤N(E) and G=TH⟨[−1]⟩. This precise number can also be used to improve the (estimated) upper bound of the length of optimal r-LRCs presented in [9, Proposition 4.6] (in the case 2∤N(E)). If 2∤N(E), then the range of the number of local repair groups m in [9, Proposition 4.6] can be improved from “1≤t<m≤⌈r+1N(E)⌉−2” to “1≤t<m≤⌈r+1N(E)⌉−1”.
In the following, we present two representative explicit constructions of optimal (r,3)-LRCs and (2,δ)-LRCs with lengths slightly less than q+2q from the above Theorem III.1. There exist other constructions with code lengths exceeding q+1. We do not list them all here.
Corollary III.1**.**
Let q=22s for a positive integer s. For any positive divisor h≥3 of q+2q+1, there exist an optimal (r=2h−2,δ=3)-LRC and an optimal (r=2,δ=2h−1)-LRC with parameters [m⋅2h,tr+1,(m−t)⋅2h]q for any integers t and m satisfying 1≤t<m≤2hq+2q+1−h−1.
Proof.
By [8, Lemma 15], there exists an explicit maximal elliptic function field E/Fq with N(E)=q+2q+1. Since 2∤N(E) and there exists a subgroup H≤PE1 of order h for any divisor h≥3 of N(E), this corollary holds by Theorem III.1.
∎
Corollary III.2**.**
Let q=p2s for an odd prime p and a positive integer s. For any positive divisor h≥3 of q+2q, there exist an optimal (r=2h−2,δ=3)-LRC and an optimal (r=2,δ=2h−1)-LRC with parameters [m⋅2h,tr+1,(m−t)⋅2h]q for any integers t and m satisfying 1≤t<m≤2hq+2q−h−1.
Proof.
By Lemma II.4 (i), there exists an elliptic function field E/Fq with N(E)=q+2q. Since 2∤N(E) and there exists a subgroup H≤PE1 of order h for any divisor h≥3 of N(E), this corollary follows from Theorem III.1.
∎
III-C Construction II of Optimal (r,3)-LRCs and (2,δ)-LRCs by the General Framework
In this subsection, we present the second family of optimal (r,3)-LRCs and (2,δ)-LRCs based on the general framework in Section III-A, making use of a subgroup THA≤Aut(E/Fq) with [−1]∈/A.
Theorem III.2**.**
Let E/Fq be an elliptic function field with N(E) rational places.
Let H be a subgroup of order h of PE1 and let A be a nontrivial subgroup of order a of Aut(E,O) such that G:=THA is a subgroup of Aut(E/Fq) (see Lemma II.9).
Assume [−1]∈/A and ah≥3. Let F:=EG, and r=ah−2,δ=3 (or r=2,δ=ah−1). Then there exist rational places [P1,…,Pr+δ−1],{P1,1,…,P1,r+δ−1},…,{Pℓ,1,…,Pℓ,r+δ−1} of E satisfying the conditions in Proposition III.1 (including conditions (17) and (18)), where
[TABLE]
Consequently, by Propositions III.1 and III.2, there exist an optimal (r=ah−2,δ=3)-LRC and an optimal (r=2,δ=ah−1)-LRC with parameters
[m⋅ah,tr+1,(m−t)⋅ah]q
for any 1≤t<m≤ℓ.
Proof.
It suffices to prove the case r=ah−2 and δ=3, from which the case r=2 and δ=ah−1 can be deduced by Remark III.1 (iii).
Let r=ah−2 and δ=3. By Lemma II.1, we obtain ConE/F(O∩F)=∑P∈HaP.
We directly define the list of rational places [P1,P2,…,Pr+2] of E to be an arbitrary list such that ∑j=1r+2Pj=ConE/F(O∩F)=∑P∈HaP (i.e., letting Q∞=O∩F in Proposition III.1) and Pr+1=Pr+2=O, which is valid since a=∣A∣≥2.
In the following, we divide our discussion into two cases: 2∤aN(E) and 2∣aN(E), and we separately select sets of rational places {P1,1,…,P1,r+2}, …, {Pℓ,1,…,Pℓ,r+2} of E satisfying the conditions in Proposition III.1, including the condition (18), which now takes the form:
[TABLE]
(1) When 2∤aN(E), we start to select sets of rational places {P1,1,…,P1,r+2}, …, {Pℓ,1,…,Pℓ,r+2} of E that satisfy the condition (28). To this end, we first estimate the number of rational places of F that split completely in E/F. We claim that this number is at least
[TABLE]
It can be proved as follows. Note that F is a rational function field by Proposition III.1 (i).
By the Hurwitz genus formula (see (6)), we have
[TABLE]
By Lemma II.1, we have ConE/F(O∩F)=∑P∈HaP.
Let R1,…,Rv denote all the distinct rational places of E outside H that are ramified in E/F.
Then we have e(Ri∣Ri∩F)≥3 for each 1≤i≤v.
This is because e(Ri∣Ri∩F)∣[E:F]=∣G∣=ah by Lemma II.1 (iii), and 2∤ah by 2∤aN(E).
By Dedekind’s different theorem (see (5)), we have
degDiff(E/F)≥deg(∑P∈H(a−1)P+∑i=1v(e(Ri∣Ri∩F)−1)Ri)≥(a−1)h+2v.
Hence, it holds that 2ah=degDiff(E/F)≥(a−1)h+2v by (30), which implies v≤2ah+h. Including those rational places in H, there are at most (ah+3h)/2 rational places of E that are ramified in E/F. Therefore, by Remark II.1 (ii), there exist at least ℓ=⌈ahN(E)−(ah+3h)/2⌉ distinct rational places of F that split completely in E/F into {P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2}⊆PE1, respectively.
We claim that these ℓ sets of rational places {P1,1,…,P1,r+2}, …, {Pℓ,1,…,Pℓ,r+2} satisfy (28).
To prove this claim, we only need to prove that for all 1≤i≤ℓ and 1≤u1<u2≤r+2,
[TABLE]
Assume towards a contradiction that Pi,u1⊕Pi,u2=O for some 1≤i≤ℓ and 1≤u1<u2≤r+2. Then we have Pi,u2=[−1]Pi,u1. Since ∣G∣=ah=r+2 and G acts transitively on {Pi,1,…,Pi,r+2} by Lemma II.1 (i), we have
[TABLE]
where the second “=” is due to
[TABLE]
Note that 2∤aN(E) implies 2∤ah=r+2. By (31), there exists a rational place Pi,j0 for some 1≤j0≤r+2 such that Pi,j0=[−1]Pi,j0, i.e. [2]Pi,j0=O, which implies Pi,j0=[N(E)+1]Pi,j0=[2N(E)+1][2]Pi,j0=[2N(E)+1]O=O. This leads to a contradiction since e(Pi,j0∣Pi,j0∩F)=1 while e(O∣O∩F)>1. Thus, these ℓ sets of rational places {P1,1,…,P1,r+2}, …, {Pℓ,1,…,Pℓ,r+2} satisfy the condition (28).
(2) When 2∣aN(E), we start to select sets of rational places {P1,1,…,P1,r+2}, …, {Pℓ,1,…,Pℓ,r+2} of E that satisfy the condition (28). We briefly outline our method before proceeding. We first define G′:=G⟨[−1]⟩, a subgroup of order 2ah=2(r+2) of Aut(E/Fq). We then consider the orbits of rational places of E under the action of G′ that have length 2(r+2). Every such orbit is divided into two orbits under the action of G that have length r+2. These G-orbits of length (r+2) are finally selected as {P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2} that satisfy the condition (28).
Proceeding to the proof. Let G′:=G⟨[−1]⟩. It is a subgroup of Aut(E/Fq) of order 2(r+2) since ⟨[−1]⟩∩G={id} and ⟨[−1]⟩G=G⟨[−1]⟩ by (32). Let EG′:={u∈E:σ(u)=u for all σ∈G′}. The field EG′ is a subfield of the rational function field F=EG (see Proposition III.1 (i)), and thus is also a rational function field by Lüroth’s Theorem (see [33, Proposition 3.5.9]).
By the Hurwitz genus formula (see (6)), we have
[TABLE]
By Lemma II.1, we have ConE/EG′(O∩EG′)=∑P∈H2aP. Let R1,…,Rv denote all the distinct rational places of E outside H that are ramified in E/F. Then we have degDiff(E/EG′)≥deg(∑P∈H(2a−1)P+∑i=1v(2−1)Ri)≥(2a−1)h+v by Dedekind’s different theorem (see (5)).
Thus, it holds 4ah=degDiff(E/EG′)≥(2a−1)h+v by (33), which implies v≤2ah+h. Including those rational places in H, there are at most 2ah+2h rational places of E that are ramified in E/EG′.
Hence, by Remark II.1 (ii), there exist at least l=⌈2ahN(E)−2ah−2h⌉ distinct rational places of EG′ that split completely in E/EG′ into {T1,1,…,T1,2(r+2)},…,{Tl,1,…,Tl,2(r+2)}⊆PE1, respectively.
Note that ∣G′∣=2(r+2) and G′=G⟨[−1]⟩=⟨[−1]⟩G.
Since G′ acts transitively on {Ti,1,…,Ti,2(r+2)} for each 1≤i≤l by Lemma II.1 (i), we have
[TABLE]
where “⊔” refers to the union without intersection, and (37) follows from (34).
By (35) and (36), we get ℓ=2l=2⌈2ahN(E)−2ah−2h⌉ pairwise disjoint G-orbits: {P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2}, that lie over ℓ distinct rational places of F other than Q∞=O∩F, respectively. Moreover, {P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2} do satisfy the condition (28); otherwise, for some 1≤i≤l, the union in (36) would not be a disjoint union by (37).
The proof is complete.
∎
Based on Theorem III.2, we have the following corollary, which can be viewed as an extension of [9, Theorem 4.8].
Corollary III.3**.**
There exist an optimal (r=3h−2,δ=3)-LRC and an optimal (r=2,δ=3h−1)-LRC with parameters [m⋅3h,tr+1,(m−t)⋅3h]q for any integers t and m satisfying 1≤t<m≤ℓ, where the field size q and integers h, ℓ take one of the following cases.
(i)
q=22s* for a positive integer s, h=h02 for a positive divisor h0 of q+1, and ℓ=⌈3hq+2q+1−3h⌉;*
(ii)
q=32s* for a positive integer s, h=h02 for a positive divisor h0 of q+1, and ℓ=2⌈6hq+2q+1−8h⌉;*
(iii)
q=p2s* for an odd prime p≡2(mod3) and a positive integer s, h=h02 for a positive divisor h0 of q+1, and ℓ=2⌈6hq+2q+1−8h⌉.*
Proof.
If E/Fq is a maximal elliptic function field, then the group structure of PE1 is
[TABLE]
by Lemma II.5. Therefore, for any positive divisor h0 of q+1, there exists a subgroup of PE1 of order h=h02 defined by H:={P∈PE1:[h0]P=O}, which corresponds via the isomorphism in (38) to the subgroup <(q+1)/h0>×<(q+1)/h0> of Z/(q+1)Z×Z/(q+1)Z. Let A be a subgroup of Aut(E,O) of order a. Then for any σ∈A and P∈H={P∈PE1:[h0]P=O}, we have [h0](σ(P))=σ([h0]P)=σ(O)=O, where the first “=” follows from Remark II.2 (ii). Hence σ(P)∈H. By Lemma II.9, G:=THA must be a subgroup of order ah of Aut(E/Fq). We now can prove (i), (ii), and (iii).
(i) Let q=22s for a positive integer s. There exists an explicit maximal elliptic function field E/Fq with ∣Aut(E,O)∣=24, as shown in [8, Lemmas 9 and 15]. Let A be a subgroup of Aut(E,O) of order a=3, which must not contain the elliptic involution [−1] since [−1] is of order 2. Then there exists a subgroup THA of Aut(E/Fq) of order 3h by the above preceding discussion. Note that 2∤aN(E)=3(22s+2⋅2s+1). By Theorem III.2, the proof of (i) is completed.
(ii) Let q=32s for a positive integer s. There exists an explicit maximal elliptic function field E/Fq with ∣Aut(E,O)∣=12, as shown in [8, Lemmas 10 and 16]. An argument analogous to the proof of item (i) yields item (ii). The only difference is that, in this case, 2∣aN(E)=3(32s+2⋅3s+1), so we must employ the second estimate for ℓ in (27).
(iii) Let q=p2s for an odd prime p≡2(mod3) and a positive integer s. There exists an explicit maximal elliptic function field E/Fq with ∣Aut(E,O)∣=6, as shown in [8, Lemmas 11 and 17]. The rest of the proof is the same as above.
∎
Based on Theorem III.2 and the computation presented in [9, Section 4.5], we can also obtain q-ary optimal (7,3)-LRCs and (2,8)-LRCs with lengths at most q+2q−8, where q=42s+1 for a positive integer s.
Let E=Fq(x,y) be an elliptic function field defined by the equation y2+y=x3, where q=42s+1 for an arbitrary non-negative integer s. From the proof of [8, Lemma 15], E/Fq is a maximal elliptic function field.
Let Q∈PE1 be the unique common zero of x and y−1. Consider the translation-by-Q on the elliptic function field E explicitly given by
τQ:(x↦x2y+1,y↦yy+1)
from Group Law Algorithm 2.3 in [34]. The order of τQ is 3, since
[TABLE]
Define σ∈Aut(E,O) of order 3 by σ:(x↦u2x,y↦y), where u is a primitive third root of unity in Fq. Let A:=<σ>,H:=<Q>; then a=∣A∣=3,h=∣H∣=3.
Note that σ(Q)=Q, thus G:=THA is a subgroup of Aut(E/Fq) by Lemma II.9. Note that 2∤aN(E)=3⋅(22s+1+1)2.
By Theorem III.2, we have the following corollary.
Corollary III.4**.**
Let q=42s+1 for a positive integer s.
Then there exist an optimal (r=7,δ=3)-LRC and an optimal (r=2,δ=8)-LRC with parameters
[9m,tr+1,9(m−t)]q
for any 1≤t<m≤ℓ=⌈9q+2q−8⌉=9q+2q−8.
IV Constructions of Optimal (r,δ)-LRCs via Automorphism Groups of Hyperelliptic Function Fields
In this section, we investigate the construction of optimal (r,δ)-LRCs using hyperelliptic function fields. We first introduce a general framework for constructing optimal (r,3)-LRCs via automorphism groups of hyperelliptic function fields of genus 2, and then apply it to obtain explicit optimal (4,3)-LRCs with lengths slightly below q+4q. In the final subsection, we present the construction of optimal (g+1−g′,g+1+g′)-LRCs (0≤g′≤g−1) with lengths up to q+2gq by employing specific hyperelliptic function fields of genus g≥2.
IV-A *A Framework for Constructing Optimal (r,3)-LRCs via Automorphism Groups of Hyperelliptic Function Fields of Genus 2 *
In the following, we introduce the general framework.
Proposition IV.1**.**
Let E/Fq be a hyperelliptic function field of genus 2 defined by y2=f(x) with deg(f)=5 and 2∤char(Fq). Suppose that G is a subgroup of Aut(E/Fq). Let ∣G∣=r+2 with r≥2. Let F:=EG, and let [P1,P2,…,Pr+2] be a list444Here, a list refers to an ordered multiset of rational places of E, or equivalently, a finite sequence of (not necessarily distinct) rational places of E. of rational places of E such that ∑j=1r+2Pj=ConE/F(Q∞) for a rational place Q∞ of F. Assume degDiff(E/F)>2 (or equivalently, F is a rational function field, by Lemma II.2).
Then the following statements hold.
(i)
There exists a function z∈F such F=Fq(z) and (z)∞E=ConE/F(Q∞)=P1+P2+⋯+Pr+2.
(ii)
There exist r functions w0=1,w1,…,wr−1∈LE(P1+P2+⋯+Pr+1) that are F-linearly independent.
(iii)
Let {Pi,1,Pi,2,…,Pi,r+2} be pairwise distinct rational places of E lying over a rational place Qi of F for each 1≤i≤ℓ, such that Q∞,Q1,…,Qℓ are pairwise distinct.
Then all r×r submatrices of the following matrix
[TABLE]
are invertible for each 1≤i≤ℓ if the following conditions (C1) and (C2) are satisfied.
(C1)* Pr+2=P∞, where P∞ is the unique place at infinity of E.*
(C2)* Pi,j=Pi,j′ for any 1≤i≤ℓ and 1≤j<j′≤r+2.*
Proof.
(i) Note that F is a rational function field. Let z∈LF(Q∞)\Fq. We have
(z)∞F=Q∞, [F:Fq(z)]=deg((z)∞F)=deg(Q∞)=1
and
(z)∞E=ConE/F((z)∞F)=ConE/F(Q∞)=P1+P2+⋯+Pr+2.
(ii) Note that LE(P1)⊆LE(P1+P2)⊆⋯⊆LE(P1+⋯+Pr+1), dimFq(LE(P1))=1, and dimFq(LE(P1+⋯+Pr+1))=r+1+1−2=r by the Riemann-Roch theorem (see (2)). Furthermore, dimFq(LE(∑j=1I+1Pj))−dimFq(LE(∑j=1IPj))≤1 for each 1≤I≤r by [33, Lemma 1.4.8]. Therefore, among the r sets VI:=LE(∑j=1I+1Pj)\LE(∑j=1IPj) for 1≤I≤r, exactly r−1 of them are non-empty. Let 1≤I1<⋯<Ir−1≤r be the r−1 indexes such that VI1,…,VIr−1 are non-empty. Let w0=1, and let w1,…,wr−1 be arbitrary elements in VI1,…,VIr−1, respectively.
Now we show that w0,w1,…,wr−1 are F-linearly independent. Assume towards a contradiction that there exist rational functions f0(z),…,fr−1(z)∈F=Fq(z), not all zero, such that ∑i=0r−1fi(z)wi=0. By clearing denominators, we may assume that f0(z),…,fr−1(z) are polynomials of z. We define t:=max{0≤i≤r−1:deg(fi(z))=max{deg(fj(z)):0≤j≤r−1}} (deg(0):=−∞). It holds that ft(z)=0. Then we consider the following two possible cases to derive a contradiction. Before proceeding, we denote e:=e(P1∣Q∞)=⋯=e(Pr+2∣Q∞), and observe that vP1(z)=⋯=vPr+2(z)=−e.
•
If t=0, then we have deg(f0(z))>deg(fi(z)) for any 1≤i≤r−1.
Therefore, we have
[TABLE]
for any 1≤i≤r−1 such that fi(z)=0, where the symbol “≤” in the above inequality is due to wi∈LE(P1+⋯+Pr+2−Pr+2)=LE(∑P∣Q∞eP−Pr+2). This implies vPr+2(∑i=0r−1fi(z)wi)=vPr+2(f0(z)w0)=∞.
•
If 1≤t≤r−1, then we have deg(ft(z))≥deg(fi(z)) for any 0≤i≤t−1; and deg(ft(z))>deg(fi(z)) for any t+1≤i≤r−1. Therefore, for any 0≤i≤t−1 such that fi(z)=0, we have
[TABLE]
where “<” is due to deg(ft(z))≥deg(fi(z)) and vPIt+1(wt)<vPIt+1(wi) since vPIt+1(wt)≤−vPIt+1(∑j=1It+1Pj),555This inequality holds because otherwise we would have wt∈LE(∑j=1ItPj), contradicting the fact that wt∈LE(∑j=1It+1Pj)\LE(∑j=1ItPj). wi∈LE(∑j=1It+1Pj−PIt+1); and for any t+1≤i≤r−1 such that fi(z)=0, we have
[TABLE]
where the symbol “<” is due to deg(ft(z))>deg(fi(z)), vPIt+1(wt)≤−1 and vPIt+1(wi)≥−e since vPIt+1(wt)≤−vPIt+1(∑j=1It+1Pj), wi∈LE(∑j=1r+2Pj)=LE(∑P∣Q∞eP). Inequalities (44) and (45) imply vPIt+1(∑i=0r−1fi(z)wi)=vPIt+1(ft(z)wt)=∞.
In both cases, we arrive at a contradiction to the assumption ∑i=0r−1fi(z)wi=0.
Therefore, w0,w1,…,wr−1 are F-linearly independent.
(iii)
Assume towards a contradiction that the submatrix consisting of the u1,…,ur-th columns of
the matrix Mi in (43) is singular for some 1≤i≤ℓ and 1≤u1<⋯<ur≤r+2.
Then there exist c0,…,cr−1∈Fq, not all zero, such that (c0,…,cr−1)Mi vanishes at the positions u1,…,ur.
That is, the function w:=c0w0+⋯+cr−1wr−1 has zeros Pi,u1,…,Pi,ur. Note that w∈LE(∑j=1r+1Pj). The principal divisor of w must be of the form
[TABLE]
where P∈PE1 is an unknown rational place that will be discussed later.
Note that LF(Q∞−Qi)={0} since F is a rational function field. Let z′ be a nonzero element in LF(Q∞−Qi), then we have
We now consider all possible P∈PE1, divided into two cases.
•
P=Pi,u′ for some u′∈[r+2]\{u1,…,ur}. By (48), we have
[TABLE]
Then we have [E:Fq(z′w)]=deg((z′w)0E)=deg(Pr+2)=1. This contradicts the fact that E is a hyperelliptic function field rather than a rational function field.
•
P is a rational place with P=Pi,u′ for any u′∈[r+2]\{u1,…,ur}.
By (48), we have
[TABLE]
The above equation leads to P+Pr+2∼∑u∈[r+2]\{u1,…,ur}Pi,u, which is ridiculous by Lemma II.10, along with conditions (C1) and (C2).
Both cases lead to a contradiction, thereby completing the proof of (iii).
∎
Proposition IV.2**.**
We adopt the settings in Proposition IV.1 and assume that conditions (C1) and (C2) are satisfied.
Let t,m be integers such that 1≤t<m≤ℓ. Let V:={a0,tw0zt+∑i=0r−1∑j=0t−1ai,jwizj:a0,t∈Fq and ai,j∈Fq for 0≤i≤r−1,0≤j≤t−1}, and P:={P1,1,…,P1,r+2,…,Pm,1,…,Pm,r+2}. Define a linear code C(P,V) by
[TABLE]
Then C(P,V) is an optimal (r=∣G∣−2,δ=3)-LRC with parameters [m(r+2),tr+1,(m−t)(r+2)]q.
Proof.
The proof is similar to that of Proposition III.2. So we omit it.
∎
Using Propositions IV.1 and IV.2 with some explicit hyperelliptic curves of genus 2, one can construct optimal (3,3)-LRCs with lengths approaching q+4q, which is omitted here since it is subsumed by Theorem IV.2 later in Section IV-C.
IV-B Construction of Optimal (4,3)-LRCs via Automorphism Groups of Hyperelliptic Function Fields of Genus 2
In this subsection, we present constructions of optimal (4,3)-LRCs with lengths slightly below q+4q.
The following theorem provides a sufficient condition, under which we can select rational places [P1,…,Pr+2],{P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2} that satisfy the conditions in Proposition IV.1, including conditions (C1) and (C2). Before proceeding, we recall that ι denotes the hyperelliptic involution.
Theorem IV.1**.**
Let E/Fq be a hyperelliptic function field defined by y2=f(x) with N(E) rational places, where deg(f)=5 and 2∤char(Fq). Let G≤Aut(E/Fq) with ∣G∣=r+2, and let F:=EG.
Assume that ι∈/G, ∣G∣≥5, and ∣G∣∤N(E).
Then degDiff(E/F)>2, and there exist rational places [P1,…,Pr+2],{P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2} of E satisfying the conditions in Proposition IV.1 (including conditions (C1) and (C2)), where
ℓ=2⌈2∣G∣N(E)−4∣G∣−2⌉−1.
Consequently, there exists an optimal (r=∣G∣−2,δ=3)-LRC with parameters
[m∣G∣,tr+1,(m−t)∣G∣]q
for any integers t,m satisfying 1≤t<m≤ℓ, by Propositions IV.1 and IV.2.
Proof.
Since ∣G∣∤N(E), there exists a rational place P′ of E that is ramified in E/F; otherwise, all rational places of E would be unramified in E/F, and it would follow that ∣G∣=[E:F]∣N(E) by Lemma II.1 (ii) and (iii).
By Lemma II.1 (ii), we have e(P∣P′∩F)−1>0 for each P∈PE lying over P′∩F, and thus
[TABLE]
which implies degDiff(E/F)>2 by Dedekind’s different theorem (see (5)). Thus, F is a rational function field by Lemma II.2.
Let [P1,…,Pr+2] be a list of rational places of E such that Pr+2=P∞ and ∑j=1r+2Pj=ConE/F(P∞∩F) (i.e., letting Q∞=P∞∩F in Proposition IV.1), then the condition (C1) is satisfied.
As for the selection of {P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2} satifying (C2),
we use a similar method as that used in the proof of Theorem III.2 for the case 2∣aN(E). Recall that the hyperelliptic involution ι is of order 2 and commutes with all elements of Aut(E/Fq) (see Remark II.3). Let G′:=<ι>G={σ:σ∈G}∪{ισ:σ∈G} be a new larger subgroup of order 2∣G∣=2(r+2) of Aut(E/Fq). We now consider the function field extension E/EG′. Since F=EG is a rational function field, its subfield EG′ is also a rational function field by Lüroth’s Theorem (see [33, Proposition 3.5.9]). By the Hurwitz genus formula (see (6)), we have
[TABLE]
Thus, by Dedekind’s different theorem (see (5)), there are at most 4∣G∣+2 rational places of E that are ramified in E/EG′. Therefore, by Remark II.1 (ii), there are at least l=⌈2∣G∣N(E)−4∣G∣−2⌉ rational places of EG′ that split completely in E/EG′ into
{T1,1,…,T1,2(r+2)},…,{Tl,1,…,Tl,2(r+2)}⊆PE1, respectively. Since ∣G′∣=2(r+2) and G′ acts transitively on each of these sets by Lemma II.1 (i), for each 1≤i≤l we have
[TABLE]
where “⊔” denotes the union without intersection, and (52) follows from (49).
By (50) and (51), we get at least ℓ=2l−1=2⌈2∣G∣N(E)−4∣G∣−2⌉−1 pairwise disjoint G-orbits666To account for the worst-case scenario, we may, without loss of generality, assume that the last G-orbit {P2l,1,…,P2l,r+2} lies over Q∞=P∞∩F. We then simply discard this orbit and work with the remaining ℓ=2l−1 orbits that do not lie over Q∞.: {P1,1,…,P1,r+2},…,{Pℓ,1,…,Pℓ,r+2}, that lie over ℓ distinct rational places of F other than Q∞=P∞∩F, respectively.
Moreover, \{P_{1,1},\dots,P_{1,r+2}\},$$\dots,$$\{P_{\ell,1},\allowbreak\dots,\allowbreak P_{\ell,r+2}\} do satisfy the condition (C2) in Proposition IV.1; otherwise, for some 1≤i≤l, (51) would not be a disjoint union by (52), leading to a contradiction.
Based on the above selection of [P1,1,…,P1,r+2], {P2,1,…,P2,r+2},…,{Pℓ,1,…,Pℓ,r+2}, this theorem is proved.
∎
Using Theorem IV.1, we obtain optimal (4,3)-LRCs over two classes of finite fields, together with an explicit example.
Corollary IV.1**.**
Let q be a prime power of one of the following forms:
(i)
q=52s* for an odd positive integer s;*
(ii)
q=q2s* for an odd positive integer s and a prime power q with q=5 and q≡5,15,21, or 23(mod24).*
Then for any integers t,m with 1≤t<m≤ℓ=2⌈12q+4q−25⌉−1, there exists an optimal (4,3)-LRC with parameters
[6m,4t+1,6(m−t)]q.
Proof.
(i) We consider the hyperelliptic curve defined by y2=x5+x over Fq, where q=52s for an odd positive integer s. It is a maximal hyperelliptic curve with q+4q+1 rational points by Lemma II.13 and Lemma II.12. Let E/Fq be its function field.
It has an automorphism σ∈Aut(E/Fq) defined by the associate matrix
\left(\begin{array}[]{cc}\alpha&-1\\
-1&0\end{array}\right) (see (11)),
where α∈F25⊆Fq satisfies α2=2.
Let G:=<σ>≤Aut(E/Fq).
It is direct to verify that ∣G∣=6 and ι∈/G. Note that 6∤N(E)=q+4q+1=52s+4⋅5s+1=(6−1)2s+4⋅(6−1)s+1 since 2∤s.
Then by Theorem IV.1, item (i) holds.
(ii) We consider the hyperelliptic curve defined over Fq by the equation y2=x5+x, where q=q2s for an arbitrary odd prime power q=5 with q≡5 or 7(mod8) and an odd positive integer s. It is a maximal hyperelliptic curve by Lemma II.13 and Lemma II.12. Let E/Fq be its function field.
By Lemma II.15 and some concrete computations, we obtain an automorphism σ1∈Aut(E/Fq) of order 2 defined by the associated matrix
\left(\begin{array}[]{cc}0&-1\\
-1&0\end{array}\right), and an automorphism σ2∈Aut(E/Fq) of order 3 defined by the associated matrix
\left(\begin{array}[]{cc}2^{-1}(\alpha^{2}-1)&2^{-1}(\alpha-\alpha^{3})\\
2^{-1}(\alpha^{3}-\alpha)&2^{-1}(-\alpha^{2}-1)\end{array}\right) (see (11)),
where α=u8q−1, with u a primitive element of Fq.
It is worth verifying that σ2:(x↦(α3−α)x+(−α2−1)(α2−1)x+(α−α3),y↦2−3((α3−α)x+(−α2−1))3y) is indeed an automorphism in Aut(E/Fq).
To this end, we first check that (σ2(y))2=(σ2(x))5+σ2(x), which is equivalent to verifying that
[TABLE]
Note that (1+α2)2=2α2 since α4=−1.
Multiplying both sides by (1+α2)6, the above identity to be verified becomes
[TABLE]
The right hand side equals (−2x+2α)(−2αx−2α2)((−2x+2α)4+α4(−2x−2α)4)=−8α2⋅26(x5+x), which is equal to the left hand side.
Define σ3 as σ3:(x↦(α−α3)x+(α2−1)(−α2−1)x+(α3−α),y↦2−3((α−α3)x+(α2−1))3y). We can similarly verify that (σ3(y))2=(σ3(x))5+σ3(x), and that σ3 is the inverse of σ2. Hence, σ2 is indeed an element of Aut(E/Fq).
Let G:=<σ1,σ2>. It is a dihedral subgroup of Aut(E/Fq) of order 6, satisfying the relation σ1σ2σ1=σ2−1, and it does not contain the hyperelliptic involution ι. To apply Theorem IV.1, we examine under what conditions N(E)=q+4q+1 is not divisible by 6.
•
q≡5(mod8). In this case, we consider three subcases q≡5,13,21(mod24). In these three subcases, we have N(E)=q+4q+1=q2s+4qs+1≡−2,0,4(mod6), respectively, where s is an odd positive integer.
Thus, when the condition “q≡5(mod8)” is strengthened to “q≡5 or 21(mod24)”, we have 6∤N(E).
•
q≡7(mod8). In this case, we consider three subcases q≡7,15,23(mod24). In these three subcases, we have N(E)=q+4q+1=q2s+4qs+1≡0,4,−2(mod6), respectively, where s is an odd positive integer. Thus, when the condition “q≡7(mod8)” is strengthened to “q≡15 or 23(mod24)”, we have 6∤N(E).
Based on the above discussion, the proof is complete by Theorem IV.1.
∎
Indeed, the above ℓ=2⌈12q+4q−25⌉−1 in Corollary IV.1 is just a worst-case estimation on the number of local repair groups,
when it comes to the explicit constructions over concrete finite fields, sometimes the number of local repair groups can be greater than ℓ, we give an explicit example to illustrate this. In the following example, we present an optimal (4,3)-LRCs over F25 with length 36, which is greater than the worst-case estimation ℓ⋅6=(2⌈1225+425−25⌉−1)⋅6=18.
Example IV.1**.**
We consider the hyperelliptic function field E/F25 defined by the equation y2=x5+x over F25=F5(u), where u is a primitive element of F25 satisfying the equation u2+4u+2=0. Let α=u3, which satisfies α2=2.
Let G be a subgroup of Aut(E/Fq) of order 6 generated by σ:(x↦−u3+x1,y↦x3y), whose associated matrix is (u3−1−10). Let r=4,δ=3. With the help of the MAGMA calculator [43], we select [P1,…,P6], {P1,1,…,P1,6}, …, {P6,1,…,P6,6} satisfying the conditions in Proposition IV.1 (including the conditions (C1) and (C2)) as follows:
[TABLE]
[TABLE]
Based on the above selections and Proposition IV.1, we define the functions z,w0,w1,w2,w3 as
[TABLE]
[TABLE]
At last, by Proposition IV.2 (taking t=1,m=ℓ=6), we get the following 5×36 generator matrix, which generates an optimal (4,3)-LRC with parameters [36,5,30]25. Here, the vertical lines are used to separate the local repair groups. The parameters of this linear code, including its (4,3)-locality, are all verified by the MAGMA calculator [43].
[TABLE]
IV-C Construction of Optimal (g+1−g′,g+1+g′)-LRCs via Hyperelliptic Function Fields of Genus g≥2
Inspired by [17, Theorem 21] where either optimal or almost optimal (4,2)-LRCs are presented, we consider the construction of optimal (r,δ)-LRCs via hyperelliptic function fields of genus g≥2, and have the following result.
Theorem IV.2**.**
Let g≥2 be an integer.
Let q be a prime power of one of the following forms:
(i)
q=(2g+1)2s* for a positive integer s (in this case, 2g+1 must be a prime power);*
(ii)
q=q2s* for an odd prime power q satisfying q≡−1(mod2g+1) and a positive integer s.*
Then there exists an (r=g+1−g′,δ=g+1+g′)-LRC with parameters
[TABLE]
for any integers g′,t,m satisfying −(g−1)≤g′≤g−1 and 1≤t<m≤ℓ=⌊2g+1q+2gq⌋.
In particular, when 0≤g′≤g−1, it is an optimal (r=g+1−g′,δ=g+1+g′)-LRC with parameters
[m(2g+1),tr+1,(m−t)(2g+1)]q.
Proof.
For both (i) and (ii), we first consider the case where s is odd. The case where s is even will be handled using a slightly different twisted curve.
(i)
Let q=(2g+1)2s for an odd positive integer s.
We consider the hyperelliptic curve C defined over Fq by the equation y2=x2g+1+x. It is a maximal hyperelliptic curve of genus g with q+2gq+1 rational points by Lemma II.13 and Lemma II.12. Let E/Fq be its function field.
Since F(2g+1)2⊆Fq, the equation Tr(2g+1)2/(2g+1)(u)=u2g+1+u=0 has 2g+1 distinct roots α1,…,α2g+1∈Fq. Let G:={σi:1≤i≤2g+1}⊆Aut(E/Fq), where
σi is defined by σi:(x↦x+αi,y↦y).
Then G is a subgroup of Aut(E/Fq) of order 2g+1. Let F:=EG.
For the place at infinity P∞ of E, we have σ(P∞)=P∞ for any σ∈G, and thus e(P∞∣Q∞)=2g+1 by Lemma II.1, where Q∞:=P∞∩F. By Dedekind’s different theorem (see (5)), degDiff(E/F)≥2g, which, along with Lemma II.2, implies that F is a rational function field.
Take z∈LF(Q∞)\Fq.
We define the vector space V of functions of E that will be used for evaluation by
[TABLE]
We now prove that V is of dimension tr+1. For this, it suffices to show that x0,x1,…,xr−1 are F-linearly independent. Assume towards a contradiction that there exist rational functions f0(z),…,fr−1(z)∈F=Fq(z), not all zero, such that ∑i=0r−1fi(z)xi=0. By clearing denominators, we may assume that f0(z),…,fr−1(z) are polynomials of z. Note that vP∞(x)=−2 and vP∞(z)=−(2g+1) since (z)∞E=ConE/F((z)∞F)=ConE/F(Q∞)=(2g+1)P∞.
Let 0≤i1,i2≤r−1 be two (not necessarily distinct) integers such that fi1(z)=0,fi2(z)=0, and vP∞(fi1(z)xi1)=vP∞(fi2(z)xi2).
Then we have −(2g+1)deg(fi1(z))−2i1=vP∞(fi1(z)xi1)=vP∞(fi2(z)xi2)=−(2g+1)deg(fi2(z))−2i2, which implies 2i1≡2i2(mod2g+1), and therefore, i1≡i2(mod2g+1). Since 0≤i1,i2≤r−1=g−g′≤2g−1, we have i1=i2.
Thus, the valuations vP∞(fi(z)xi) (0≤i≤r−1) with fi(z)=0 are pairwise distinct, which, together with the strict triangle inequality, leads to a contradiction with the assumption ∑i=0r−1fi(z)xi=0. Therefore, x0,x1,…,xr−1 are F-linearly independent, and then dimFq(V)=tr+1.
We then select the rational places that will be used for evaluation.
For any affine rational place P(α,β) of E, the orbit G(P(α,β)):={P(α+αj,β):1≤i≤2g+1} is a G-orbit of length 2g+1. Since E has q+2gq affine rational places, there are totally ℓ=2g+1q+2gqG-orbits of the form {P(α+αi,β):1≤i≤2g+1}. We denote all these G-orbits by {P1,1,…,P1,2g+1}, …, {Pℓ,1,…,Pℓ,2g+1}. The rational places in these ℓ orbits lie over ℓ distinct rational places of F other than Q∞=P∞∩F, respectively. Let P:={P1,1,…,P1,2g+1,…,Pm,1,…,Pm,2g+1} be the places for evaluation.
We define a linear code C(P,V) by
[TABLE]
Note that V⊆LE(t(2g+1)P∞+max{0,2(r−1)−(2g+1)}P∞)=LE(t(2g+1)P∞+max{0,−2g′−1}P∞) since (x)∞E=2P∞ and (z)∞E=(2g+1)P∞. By Section II-A, the dimension of C(P,V) is k=dimFq(V)=tr+1 and the minimum distance d of C(P,V) satisfies d≥m(2g+1)−(t(2g+1)+max{0,−2g′−1})=(m−t)(2g+1)+min{0,2g′+1}.
To prove that C(P,V) is an (r=g+1−g′,δ=g+1+g′)-LRC, it suffices to note that for any 1≤i≤m,
[TABLE]
and that x(Pi,1),…,x(Pi,r+δ−1) are pairwise distinct, which imply that C(P,V)∣{(i−1)(r+δ−1)+1,…,i(r+δ−1)} is a Reed-Solomon code with minimum distance ((r+δ−1)−(r−1))=δ. Invoking the Singleton-type bound (1), we have d≤(m−t)(2g+1). Thus, when 0≤g′≤g−1, the minimum distance d is determined to be (m−t)(2g+1) and C(P,V) is an optimal (r=g+1−g′,δ=g+1+g′)-LRC.
As for the case q=(2g+1)2s for an even positive integer s, we consider the (twisted) hyperelliptic curve C′/Fq defined by γy2=x2g+1+x, where γ∈Fq\{β2:β∈Fq}, i.e., a quadratic non-residue in Fq.
Note that the number of distinct roots in Fq of γy2=α2g+1+α and the number of distinct roots in Fq of y2=α2g+1+α sum to 2 for any α∈Fq. Thus, the numbers of affine rational points of C′/Fq and C/Fq (defined by y2=x2g+1+x) sum to 2q. By Lemmas II.13 and II.12, the curve C/Fq is a minimal curve of genus g, and then C′/Fq is a maximal hyperelliptic curve of genus g. The rest of the proof is similar to the above argument where s is odd, using the curve C′/Fq.
(ii) Let q=q2s for an odd prime power q satisfying q≡−1(mod2g+1) and an odd positive integer s. We consider the hyperelliptic curve defined over Fq by y2=x2g+1+1. It is a maximal hyperelliptic curve of genus g by Lemma II.14 and Lemma II.12. Let E/Fq be its function field.
It has an automorphism σ∈Aut(E/Fq) defined as σ:(x↦u2g+1q−1x,y↦y),
where u is a primitive element of Fq. Let G:=<σ>, a cyclic group of order 2g+1, and let F:=EG. The rest of the proof is similar to the proof of (i). The only difference worth emphasizing is that the number ℓ of G-orbits of length 2g+1 becomes ℓ=2g+1q+2gq−2, since there are two affine rational places P(α,β) of E satisfying α=0, P(0,1) and P(0,−1).
As for the case q=q2s for an odd prime power q satisfying q≡−1(mod2g+1) and an even positive integer s, we consider the hyperelliptic curve defined over Fq by γy2=x2g+1+1, where γ is a quadratic non-residue in Fq. Arguing similarly to the end of the proof of (i), this is a maximal hyperelliptic curve of genus g. The remainder of the proof is similar to the above (the definitions of E, G, and F are all the same, so we omit them). The only difference worth emphasizing is that the number ℓ of G-orbits of length 2g+1 becomes ℓ=2g+1q+2gq, since any affine rational places P(α,β) of E satisfies α=0.
Note that in all the above four subcases, it holds ℓ=⌊2g+1q+2gq⌋. This theorem is proved.
∎
Remark IV.1**.**
(i)
Letting g=2,g′=−1 and 2∤s, Theorem IV.2 implies **[17, Theorem 21]**.
(ii)
When g=1 and g′=0, the statements in Theorem IV.2 still hold by **[8, Theorem 1]**. Therefore, Theorem IV.2 can be viewed as an extension of **[8, Theorem 1]**.
After completing the above proof of Theorem IV.2, we observe that the function z∈LF(Q∞)\Fq=LF(P∞∩F)\Fq can, in fact, be explicitly chosen as z=y. This motivates us to explore further constructions. In the next section, we present optimal (r,δ)-LRCs with even longer code lengths, using some superelliptic curves adapted from the Norm-Trace curves.
V Constructions of Optimal (r,δ)-LRCs via Superelliptic Curves from Norm-Trace Curves
In this section, we present constructions of optimal (r,δ)-LRCs via some superelliptic curves from Norm-Trace curves, and particularly the Hermitian curves.
Before presenting them, we recall the definition and some related properties of superelliptic curves and Norm-Trace curves. We refer to [44] by Galbraith et al. and [45] by Geil, respectively.
Let Fq be a finite field with q elements. Let f(x)∈Fq[x] be a monic777The polynomial f(x) is allowed to be not monic in this paper; see Remark V.1 for details. polynomial of degree N such that gcd(f(x),f′(x))=1, where f′(x) is the formal derivative of f(x). Let M be a positive integer such that gcd(M,N)=1 and gcd(M,char(Fq))=1. Then the curve
C:yM=f(x)
is called a superelliptic curve.
Let C be a superelliptic curve over Fq as in Definition V.1. Then
(i)
C* is nonsingular as an affine curve.*
(ii)
There is only one point, P∞, at infinity on the normalisation of C and this point is defined over Fq.
(iii)
The genus of C is 21(M−1)(N−1).
Remark V.1**.**
The polynomial f(x) in Definition V.1 is required to be monic. However, Lemma V.1 remains valid even without this condition. Indeed, assume that f(x) is not monic and satisfies all other conditions in Definition V.1.
Since gcd(M,N)=1, we can transform the equation yM=f(x) into a new equation yM=F(x) with F(x) monic and satisfy all conditions in Definition V.1
by an invertible polynomial map σ:(x↦αx,y↦βy), where α,β∈Fq∗. This is an Fq-isomorphism, which does not affect the properties listed in Lemma V.1. In what follows, we do not require f(x) to be monic, for simplicity.
Let E/Fq be the function field of a superelliptic curve C/Fq. For an affine rational point (α,β)∈C(Fq), we denote its corresponding rational place of E by P(α,β), which is the unique common zero of x−α and y−β. For the point at infinity P∞, we still denote its corresponding rational place of E by P∞, which is the unique common pole of x and y.
Next, we briefly review the Norm-Trace curves.
Definition V.2**.**
Let q be a prime power and s be a positive integer. The Norm-Trace curve Xq,s over Fqs is defined by the equation
yq−1qs−1=xqs−1+xqs−2+⋯+xq0.
When s=2, it is the well-known Hermitian curve.
It has exactly one point at infinity, along with q2s−1 affine rational points. Its genus is
2qs−1−1(q−1qs−1−1).
V-A A General Framework for Constructing Optimal (r,δ)-LRCs via Superelliptic Curves
We are now ready to introduce our general framework for constructing optimal (r,δ)-LRCs via superelliptic curves. The use of superelliptic curves here is for convenience only; the framework can naturally be extended to a broader class of curves.
Proposition V.1**.**
Let C be a superelliptic curve defined over Fq by an equation of the form γyM=xN+(lower order terms of x),
where γ∈Fq∗. Let E/Fq be its function field. Then the following two classes of optimal (r,δ)-LRCs exist under certain assumptions.
(i)
Assume M<N. Let r=⌊MN−1⌋+1−b′ and δ=N+1−r≥2 for an integer 0≤b′≤⌊MN−1⌋−1. Assume also that there exist pairwise disjoint sets of affine rational places of E:
{P1,1,…,P1,r+δ−1},…,{Pℓ,1,…,Pℓ,r+δ−1}, such that for each 1≤i≤ℓ, x(Pi,1),…,x(Pi,r+δ−1) are pairwise distinct and y(Pi,1)=⋯=y(Pi,r+δ−1). Then for any 1≤t<m≤ℓ, there exists
an optimal (r=⌊MN−1⌋+1−b′,δ=N+1−r)-LRC with parameters
[mN,tr+1,(m−t)N]q.
(ii)
Assume M>N. Let r=⌊NM−1⌋+1−b′ and δ=M+1−r≥2 for an integer 0≤b′≤⌊NM−1⌋−1. Assume also that there exist pairwise disjoint sets of affine rational places of E:
{P1,1,…,P1,r+δ−1},…,{Pℓ,1,…,Pℓ,r+δ−1} such that for each 1≤i≤ℓ, y(Pi,1),…,y(Pi,r+δ−1) are pairwise distinct and x(Pi,1)=⋯=x(Pi,r+δ−1). Then for any 1≤t<m≤ℓ, there exists an optimal (r=⌊NM−1⌋+1−b′,δ=M+1−r)-LRC with parameters
[mM,tr+1,(m−t)M]q.
Proof.
(i)
Let P:={P1,1,…,P1,r+δ−1,…,Pm,1,…,Pm,r+δ−1}, and V:={a0,tx0yt+∑i=0r−1∑j=0t−1ai,jxiyj:a0,t∈Fq and ai,j∈Fq for 0≤i≤r−1,0≤j≤t−1}. Define a linear code C(P,V) by
[TABLE]
First, we prove that C(P,V) is an (r=⌊MN−1⌋+1−b′,δ=N+1−r)-LRC. For this, it suffices to note that for any 1≤i≤m, C(P,V)∣{(i−1)(r+δ−1)+1,…,i(r+δ−1)}={(ϕ(Pi,1),…,ϕ(Pi,r+δ−1)):ϕ∈spanFq{x0,x1,…,xr−1}}, and that x(Pi,1),…,x(Pi,r+δ−1) are pairwise distinct, which imply that C(P,V)∣{(i−1)(r+δ−1)+1,…,i(r+δ−1)} is a Reed-Solomon code with minimum distance ((r+δ−1)−(r−1))=δ.
Next, we prove that V has dimension tr+1. To this end, it suffices to show that the tr+1 functions x0yt,xiyj(0≤i≤r−1,0≤j≤t−1), which span V, have pairwise distinct valuations at the place at infinity P∞. Note that the functions x and y each have a unique pole P∞. We have vP∞(x)=−[E:Fq(x)]=−[Fq(x,y):Fq(x)]=−M and vP∞(y)=−[E:Fq(y)]=−[Fq(x,y):Fq(y)]=−N by [33, Theorem 1.4.11]. Thus, vP∞(xiyj)=−Mi−Nj.
Since 0<r−1=⌊MN−1⌋−b′<MN, the functions x0yt,xiyj(0≤i≤r−1,0≤j≤t−1) have pairwise distinct valuations at P∞. Therefore, these tr+1 functions are Fq-linearly independent by the strict triangle inequality. Then we have dimFq(V)=tr+1.
As a by-product of the above argument, we also obtain V⊆LE(tNP∞).
Hence, C(P,V) has dimension tr+1 and minimum distance at least (m−t)N by Section II-A. By the Singleton-type bound (1), we conclude that the minimum distance of C(P,V) is exactly (m−t)N, and C(P,V) is an optimal (r=⌊MN−1⌋+1−b′,δ=N+1−r)-LRC.
(ii) By interchanging x and y, and swapping M with N in the above proof of (i), we can prove (ii).
∎
V-B Construction of Optimal (r,δ)-LRCs via Superelliptic Curves from Norm-Trace Curves
In this subsection, we present constructions of optimal (r,δ)-LRCs based on Proposition V.1. Before proceeding, we introduce the curves that will be used in our constructions.
Lemma V.2**.**
Let q=qs for a prime power q and an integer s≥2. Let b be a positive divisor of q−1qs−1, and let c be a positive divisor of s. Denote M=b(q−1)qs−1 and N=qs−c. Then the curve C defined over Fq by
[TABLE]
is a superelliptic curve of genus 2(M−1)(N−1). It has (gcd(b,q−1qc−1)⋅bqcq(q−1)+qcq+1) rational points, including one rational point at infinity.
Proof.
The genus of the superelliptic curve C is 2(M−1)(N−1) by Lemma V.1. We now count the affine rational points of C/Fq=C/Fqs. That is, the number of pairs (α,β)∈Fqs2 satisfying βb(q−1)qs−1=αqs−c+αqs−2c+⋯+αqc+αq0=Trqs/qc(α).
By the property of the trace map Trqs/qc from Fqs to Fqc, for any β∈Fqs satisfying βb(q−1)qs−1∈Fqc, there are exactly qs−c distinct α∈Fqs, such that βb(q−1)qs−1=Trqs/qc(α). Also, for any β∈Fqs satisfying βb(q−1)qs−1∈/Fqc, there exists no α∈Fqs such that βb(q−1)qs−1=Trqs/qc(α). Therefore, to determine the number of affine rational points of C/Fqs, we only need to count the elements β∈Fqs satisfying βb(q−1)qs−1∈Fqc, and then multiply the result by qs−c. We consider the following two cases.
•
β=0. Clearly, βb(q−1)qs−1=0∈Fqc.
•
β=ui for a primitive element u of Fqs and an integer 0≤i≤qs−2. Then
βb(q−1)qs−1∈Fqc if and only if (uib(q−1)qs−1)qc−1=1, which is equivalent to gcd(b,q−1qc−1)b∣i.
Thus, the number of elements β∈Fqs satisfying βb(q−1)qs−1∈Fqc is 1+(qs−1)/gcd(b,q−1qc−1)b=gcd(b,q−1qc−1)⋅b(qs−1)+1. Multiplying it by qs−c, together with the unique rational point at infinity (see Lemma V.1), we complete the proof.
∎
Then we have the following explicit construction of optimal (r,δ)-LRCs.
Theorem V.1**.**
Let q=qs for a prime power q and an integer s≥2. Let b be a positive proper divisor of q−1qs−1, and let c be a positive proper divisor of s. Denote M=b(q−1)qs−1 and N=qs−c. Then we have the following two classes of explicit optimal (r,δ)-LRCs, depending on whether M<N or M>N.
(i)
If M<N, then for any 0≤b′≤⌊MN−1⌋−1, there exists an optimal (r=⌊MN−1⌋+1−b′,δ=N+1−r)-LRC with parameters
[mN,tr+1,(m−t)N]q
for any 1≤t<m≤ℓ=Ngcd(b,q−1qc−1)⋅bqc(q−1)q+qcq.
(ii)
If M>N, then for any 0≤b′≤⌊NM−1⌋−1, there exists an optimal (r=⌊NM−1⌋+1−b′,δ=M+1−r)-LRC with parameters
[mM,tr+1,(m−t)M]q
for any 1≤t<m≤ℓ=Mgcd(b,q−1qc−1)⋅bqc(q−1)q.
Proof.
(i) M<N.
We use the superelliptic curve C given in Lemma V.2, defined over Fq=Fqs by the equation yM=xN+xqs−2c+⋯+xqc+xq0=Trqs/qc(x). For each affine rational point (α,β)∈C(Fq), we have a set {(α+αi,β):1≤i≤N}⊆C(Fq), where α1,…,αN∈Fq are the N=qs−c distinct roots of the equation Trqs/qc(z)=0. These sets are either disjoint or identical. There are totally ℓ=Ngcd(b,q−1qc−1)⋅bqc(q−1)q+qcq such sets since C/Fq has (gcd(b,q−1qc−1)⋅bqc(q−1)q+qcq) affine rational points by Lemma V.2. Let E/Fq be the function field of C/Fq. We convert the affine rational points in each of these ℓ sets into the corresponding affine rational places, and denote the ℓ new sets of affine rational places by {Pi,1,…,Pi,r+δ−1} (1≤i≤ℓ). For each 1≤i≤ℓ, the values x(Pi,1),…,x(Pi,r+δ−1) are pairwise distinct, while y(Pi,1),…,y(Pi,r+δ−1) are all the same. By Proposition V.1 (i), the proof is complete.
(ii) M>N.
We also use the superelliptic curve C in Lemma V.2, defined over Fq=Fqs by the equation yM=xN+xqs−2c+⋯+xqc+xq0=Trqs/qc(x). For each affine rational point (α,β)∈C(Fq) with β=0, we have a set {(α,βiβ):1≤i≤M}⊆C(Fq), where β1,…,βM∈Fq are the M distinct roots of the equation zM=1 (note that M=b(q−1)qs−1∣(q−1)). These sets are either disjoint or identical.
There are totally ℓ=Mgcd(b,q−1qc−1)⋅bqc(q−1)q such sets since there are totally (gcd(b,q−1qc−1)⋅bqc(q−1)q) affine rational points (α,β) of C/Fq with β=0 by the proof of Lemma V.2. Let E/Fq be the function field of C/Fq. We convert the affine rational points in each of these ℓ sets into the corresponding affine rational places, and denote the ℓ new sets of affine rational places by {Pi,1,…,Pi,r+δ−1} (1≤i≤ℓ). For each 1≤i≤ℓ, the values y(Pi,1),…,y(Pi,r+δ−1) are pairwise distinct, while x(Pi,1),…,x(Pi,r+δ−1) are all the same. By Proposition V.1 (ii), the proof is complete.
∎
In the following example, we present two representative constructions by Theorem V.1.
Example V.1**.**
(i)* Fixing c=1 in Theorem V.1, for any prime power q=qs with s≥2, any divisor b of q−1qs−1 satisfying 1<b<q−1qs−1, and any 0\leq b^{\prime}\leq\big{\lfloor}{b\frac{({\overline{q}}-1)({\overline{q}}^{s-1}-1)}{{\overline{q}}^{s}-1}\big{\rfloor}}-1, we have an explicit q-ary optimal (r=\big{\lfloor}{b\frac{({\overline{q}}-1)({\overline{q}}^{s-1}-1)}{{\overline{q}}^{s}-1}}\big{\rfloor}+1-b^{\prime},\delta={\overline{q}}^{s-1}+1-r)-LRC with length up to bq1q2+bqb−1q.*
(ii)* Fixing b=1 in Theorem V.1, for any prime power q=qs with s≥2, any positive proper divisor c of s, and any 0\leq b^{\prime}\leq\big{\lfloor}\frac{({\overline{q}}^{s}-{\overline{q}})}{{\overline{q}}^{s-c}({\overline{q}}-1)}\big{\rfloor}-1, we have an explicit q-ary optimal (r=\big{\lfloor}\frac{({\overline{q}}^{s}-{\overline{q}})}{{\overline{q}}^{s-c}({\overline{q}}-1)}\big{\rfloor}+1-b^{\prime},\delta=\frac{{\overline{q}}^{s}-1}{{\overline{q}}-1}+1-r)-LRC with length up to qcq(q−1).*
As illustrated in the above example,
Theorem V.1 can produce constructions of optimal (r,δ)-LRCs with considerable code lengths. However, when we aim to fix r,δ and construct optimal (r,δ)-LRCs as the field size q tends to infinity, it is not ideal. We therefore consider a different class of constructions. In the following final part of the main result, employing a class of maximal superelliptic curves from Hermitian curves and their constant field extensions, we derive a new class of optimal (r,δ)-LRCs, which generalizes and improves Theorem IV.2 (i) in Section IV-C.
V-C Construction of Optimal (r,δ)-LRCs via Maximal Superelliptic Curves from Hermitian Curves
First, we introduce the maximal curves that will be used in our constructions, which are adapted from Hermitian curves.
Lemma V.3**.**
Let q=q2s for a prime power q and a positive integer s. Let b be a positive divisor of q+1.
(i)
When s is an odd positive integer, the curve C defined over Fq by the equation
ybq+1=xq+x
is a maximal superelliptic curve of genus 2(bq+1−1)(q−1). It has q+(bq+1−1)(q−1)q+1 rational points, including one rational point at infinity.
(ii)
When q is odd, b=2q+1, and s is an even positive integer, the curve C′ defined over Fq by the equation
γybq+1=γy2=xq+x
is a maximal superelliptic curve of genus 2q−1,
where γ is an arbitrary quadratic non-residue in Fq.
(iii)
When q=2, b=1, and s is an even positive integer, the curve C′′ defined over Fq by the equation
ybq+1=y3=x2+x+η=xq+x+η is a maximal superelliptic curve of genus 1, where η is an arbitrary element in Fq\{α2+α:α∈Fq}.
Proof.
(i) By Lemma V.2 (with the parameters in that lemma set to s=2 and c=1), C/Fq2 is a superelliptic curve of genus 2(bq+1−1)(q−1), and has bq3−q+q+1 rational points. Thus, C/Fq2 is a maximal curve since bq3−q+q+1=q2+22(bq+1−1)(q−1)q+1. By Lemma II.12, C/Fq is also a maximal curve, where q=q2s with 2∤s. The item (i) is proved.
(ii) Note that the number of distinct roots in Fq of γy2=αq+α and the number of distinct roots in Fq of y2=αq+α sum to 2 for any α∈Fq. The total number of affine rational points of C′/Fq defined by γy2=xq+x and C/Fq defined by y2=xq+x must be 2q.
Since C/Fq is minimal by Lemma II.12 and the proof of (i), it follows that C′/Fq is maximal.
For the proof of (iii), we refer to the proof of [8, Lemma 15], with the roles of
x and
y swapped.
∎
Then we have the following explicit constructions.
Theorem V.2**.**
Let q=q2s, where q is a prime power and s is an odd positive integer. Let b be a positive proper divisor of q+1. We have the following two classes of q-ary optimal (r,δ)-LRCs, depending on the value of b.
(i)
If b>1, then for any 0≤b′≤b−2, there exists an optimal (r=b−b′,δ=q+1−r)-LRC with parameters
[mq,tr+1,(m−t)q]q
for any 1≤t<m≤ℓ=qq+(bq+1−1)(q−1)q. In particular, when q is odd and b=2q+1, the integer s no longer needs to be odd; it can be any positive integer.
(ii)
If b=1, then there exists an optimal (r=2,δ=q)-LRC with parameters
[m(q+1),tr+1,(m−t)(q+1)]q
for any 1≤t<m≤ℓ=⌊q+1q+q(q−1)q⌋. In particular, when q=2, the integer s no longer needs to be odd; it can be any positive integer.
Proof.
To apply Proposition V.1, we consistently take M=bq+1 and N=q below, although they do not explicitly appear in the proof. Note that ⌊MN−1⌋=b−1 when b>1, and ⌊NM−1⌋=1 when b=1.
(i) b>1. Let q=q2s for a prime power q and an odd positive integer s. By Lemma V.3 (i), the curve C/Fq defined by ybq+1=xq+x is a maximal superelliptic curve of genus 2(bq+1−1)(q−1). For each affine rational point (α,β)∈C(Fq), we have a set {(α+αi,β):1≤i≤q}⊆C(Fq), where α1,…,αq∈Fq are the q distinct roots of the equation zq+z=0. These sets are either disjoint or identical. There are totally ℓ=qq+(bq+1−1)(q−1)q such sets since C/Fq has q+(bq+1−1)(q−1)q affine rational points. Let E/Fq be the function field of C/Fq. We convert the affine rational points in each of these ℓ sets into the corresponding affine rational places, and denote the ℓ new sets of affine rational places by {Pi,1,…,Pi,r+δ−1} (1≤i≤ℓ). For each 1≤i≤ℓ, the values x(Pi,1),…,x(Pi,r+δ−1) are pairwise distinct, while y(Pi,1),…,y(Pi,r+δ−1) are all the same.
By Proposition V.1 (i), the proof is complete.
As for the special case where q=q2s with 2∤q, b=2q+1, and 2∣s,
we use the maximal curve C′/Fq in Lemma V.3 (ii) defined by γybq+1=γy2=xq+x, where γ is an arbitrary quadratic non-residue in Fq. The rest of the proof is the same as above.
(ii) b=1. Let q=q2s for a prime power q and an odd positive integer s. By Lemma V.3 (i), the curve C/Fq defined by ybq+1=yq+1=xq+x is a maximal superelliptic curve of genus 2q(q−1). For each affine rational point (α,β)∈C(Fq) with β=0, we have a set {(α,βiβ):1≤i≤q+1}⊆C(Fq), where β1,…,βq+1∈Fq are the q+1 distinct roots of the equation zq+1=1 (note that (q+1)∣(q−1)). These sets are either disjoint or identical.
There are totally ℓ=q+1q+q(q−1)q−q such sets since there are totally (q+q(q−1)q−q) affine rational points (α,β) of C/Fq with β=0. Let E/Fq be the function field of C/Fq. We convert the affine rational points in each of these ℓ sets into the corresponding affine rational places, and denote the ℓ new sets of affine rational places by {Pi,1,…,Pi,r+δ−1}(1≤i≤ℓ). For each 1≤i≤ℓ, the values y(Pi,1),…,y(Pi,r+δ−1) are pairwise distinct, while x(Pi,1),…,x(Pi,r+δ−1) are all the same. Applying Proposition V.1 (ii), the proof is complete.
As for the special case where q=q2s with q=2, b=1, and 2∣s, we use the maximal curve C′′/Fq in Lemma V.3 (iii) defined by ybq+1=y3=x2+x+η=xq+x+η, where η is an arbitrary element in Fq\{α2+α:α∈Fq}. The rest of the proof is similar to the above. The only difference is that the number of the local repair groups becomes ℓ=q+1q+q(q−1)q since there are totally q+q(q−1)q affine rational points (α,β) of C′′/Fq with β=0. In both cases, we have ℓ=⌊q+1q+q(q−1)q⌋, the proof of (ii) is complete.
∎
Remark V.2**.**
By setting q=3,b=2q+1=2 and b′=0 in Theorem V.2(i) and setting q=2 and b=1 in Theorem V.2(ii), we recover part of [8, Theorem 1], which presents a wide class of optimal (2,2)-LRCs with lengths approaching q+2q.
Remark V.3**.**
In Theorem IV.2(i), for any odd prime power 2g+1≥5, integer 0≤g′≤g−1, we have a q-ary optimal (r=g+1−g′,δ=g+1+g′)-LRC with length up to q+2gq, where q=(2g+1)2s for any positive integer s. By setting q=2g+1, b=g+1, b′=g′ (note that here b=2q+1) in Theorem V.2(i), we directly recover Theorem IV.2(i). Moreover, Theorem V.2(i) has the following two advantages.
•
When the repair group size r+δ−1 is fixed and r becomes smaller, Theorem V.2(i) may yield longer optimal (r,δ)-LRCs than Theorem IV.2. We illustrate this with examples under two distinct parameter settings.
(1) Let g=11, g′=0 in Theorem IV.2(i). One obtains optimal q-ary (12,12)-LRCs of length q+22q. In this case, no improvement can be made by Theorem V.2(i) towards deriving longer optimal (12,12)-LRCs.
(2) Let g=11, g′=8 in Theorem IV.2(i). One obtains optimal q-ary (4,20)-LRCs of length q+22q for any q=232s. In this case, Theorem V.2(i) enables an improved construction: by choosing q=23, b=4, and b′=0, we obtain longer optimal q-ary (4,20)-LRCs of length up to q+110q for any q=232s with odd s.
The idea is to minimize b to maximize the code length.
•
Theorem V.2(i) allows constructions over a broader range of finite fields compared to Theorem IV.2(i), including those of even characteristic.
VI Concluding Remarks
In this paper, we studied the construction of optimal (r,δ)-LRCs with flexible minimum distances, particularly for the case δ≥3. By leveraging the automorphism groups of elliptic and genus-2 hyperelliptic function fields, together with their group of divisor classes of degree zero, we constructed several families of explicit optimal (r,3)-LRCs and (2,δ)-LRCs with lengths approaching q+2q or q+4q. We also employed some hyperelliptic and superelliptic curves of higher genus to construct explicit optimal (r,δ)-LRCs with even longer lengths and flexible parameters. Most of these optimal (r,δ)-LRCs have lengths exceeding q+1, and many of them attain the currently best-known code lengths.
To the best of our knowledge, all known constructions of optimal (r,δ)-LRCs with flexible minimum distances obtained via evaluation-based methods primarily focus on the case of r-LRCs (i.e., (r,δ=2)-LRCs), and then some of them are naturally extended to the case of (r,δ≥3)-LRCs. This paper demonstrates that such extensions are not always straightforward (see Section III-A, especially Remark III.1 (i) for details), and that the construction of optimal (r,δ)-LRCs for δ≥3 deserves independent attention, rather than being merely treated as a by-product of the r-LRC case.
Moreover, our constructions demonstrate that algebraic geometry codes are also highly effective for constructing optimal (r,δ)-LRCs with flexible minimum distances, even for δ≥3.
Three avenues for future research may be worth exploring.
•
Constructing more optimal (r,δ)-LRCs based on the general framework in Section III-A, for example,
optimal (r,δ)-LRCs with δ=4,5,6,….
•
Exploring whether the group of divisor classes of degree zero of higher-genus hyperelliptic or superelliptic curves can be utilized to obtain a general framework like those in Section III-A and IV-A, thus obtaining optimal (r,δ)-LRCs with a wider range of parameters and longer code lengths.
•
Conducting a more refined study of the general framework developed in Section V-A, to further generalize this framework, or to identify additional algebraic curves that fit this framework and can be used to construct long optimal (r,δ)-LRCs.
Appendix A An Upper Bound on the Length of Optimal (r,δ)-LRCs with Flexible Minimum Distance
In Section I-A, we mentioned that Guruswami et al. [16, Theorem 13 and Corollary 14] established an upper bound on the code length n of q-ary optimal r-LRCs with minimum distance d=Θ(n) and constant r, yielding n≤O(q). We also said that this bound can be generalized to the case of (r,δ)-LRCs. As our construction of optimal (r,δ)-LRCs with flexible minimum distances happens to fall within the scope of this generalized bound, we formally state and prove it.
Theorem A.1**.**
The minimum distance d of an optimal (r,δ)-LRC C with parameters [n,k,d]q satisfying nd≤32 is upper bounded by
[TABLE]
Consequently, when r,δ is fixed, the code length n of optimal (r,δ)-LRCs with d=Θ(n) and nd≤32 is upper bounded by O(q).
Proof.
By [46, Corollary 2], we have
k≤mint∈Z≥0{tr+kopt(q)(n−t(r+δ−1),d)},
where kopt(q)(n−t(r+δ−1),d) denotes the maximal possible dimension of a linear code with length n−t(r+δ−1) and minimum distance d. Letting t=\big{\lceil}\frac{n-(1-\varepsilon)\frac{qd}{q-1}}{r+\delta-1}\big{\rceil}, where ε=q21, we have t≥0 since nd≤32≤q+1q for any prime power q. By the plotkin bound, we have
kopt(q)(n−t(r+δ−1),d)≤kopt(q)((1−ε)q−1qd,d)≤logq(1/ε)=2. Hence, we have
[TABLE]
Moreover, we have a lower bound on k. Let n0=(r+δ−1)⌈r+δ−1n⌉−n,
n′=n+n0 and d′=d+n0. Since C is optimal, it holds d=n−k+1−(⌈rk⌉−1)(δ−1). Then we have (r+δ−1)∣n′ and d′=n′−k+1−(⌈rk⌉−1)(δ−1). By [23, Lemma 1], we have
[TABLE]
Combining (54), (55) and (56), we have
(r+δ−1n−(1−q21)q−1qd+1)r+2≥tr+2≥k≥n−d+1−r+δ−1δ−1(n−d+δ).
Solving this inequality with respect to d, we have d≤r(r+δ−1)(r+1)+δ(δ−1)q. The proof is complete.
∎
Bibliography46
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, “On the locality of codeword symbols,” IEEE Trans. Inf. Theory , vol. 58, no. 11, pp. 6925–6934, 2012.
2[2] N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, “Optimal linear codes with a local-error-correction property,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , 2012, pp. 2776–2780.
3[3] I. Tamo and A. Barg, “A family of optimal locally recoverable codes,” IEEE Trans. Inf. Theory , vol. 60, no. 8, pp. 4661–4676, 2014.
4[4] Y. Gao and S. Yang, “New constructions of optimal ( r , δ ) (r,\delta) -LR Cs via good polynomials,” Finite Fields Appl. , vol. 95, p. 102362, 2024.
5[5] A. Barg, I. Tamo, and S. Vlăduţ, “Locally recoverable codes on algebraic curves,” IEEE Trans. Inf. Theory , vol. 63, no. 8, pp. 4928–4939, 2017.
6[6] A. Barg, K. Haymaker, E. W. Howe, G. L. Matthews, and A. Várilly-Alvarado, “Locally recoverable codes from algebraic curves and surfaces,” in Algebraic Geometry for Coding Theory and Cryptography , E. W. Howe, K. E. Lauter, and J. L. Walker, Eds. New York, NY, USA: Springer, 2017, pp. 95–127.
7[7] L. Jin, L. Ma, and C. Xing, “Construction of optimal locally repairable codes via automorphism groups of rational function fields,” IEEE Trans. Inf. Theory , vol. 66, no. 1, pp. 210–221, 2020.
8[8] X. Li, L. Ma, and C. Xing, “Optimal locally repairable codes via elliptic curves,” IEEE Trans. Inf. Theory , vol. 65, no. 1, pp. 108–117, 2019.