Twisted Elliptic Curve Codes (TECCs)

• TECCs are algebraic–geometric evaluation codes on elliptic curves that incorporate a twist term to perturb the function space while preserving dimension.
• They employ explicit parity-check matrices via Weil differentials and establish exact minimum distance criteria with conditions for self-duality.
• The use of Schur-square invariants distinguishes TECCs from classical GRS and elliptic curve codes, underscoring their unique arithmetic structure.

Searching arXiv for the specified paper to ground the article in the cited source. Twisted elliptic curve codes (TECCs) are a class of algebraic–geometric codes introduced as a twisted analogue of elliptic curve codes, motivated by the studies of twisted generalized Reed-Solomon (TGRS) codes. The paper "On a class of twisted elliptic curve codes" initiates the study of TECCs and, in particular, analyzes a class of one-twist TECCs obtained from evaluation on rational points of a projective nonsingular elliptic curve over a finite field. For this class, the paper gives explicit parity-check matrices via Weil differentials, presents sufficient and necessary conditions of self-duality, determines the minimum distances, provides examples of MDS, AMDS, self-dual and MDS self-dual codes, and computes Schur-square dimensions to establish non-equivalence with elliptic curve codes and GRS codes (Liu et al., 3 Sep 2025).

1. Algebraic–geometric definition

Let $q$ be a prime power, let $E/\F_q$ be a projective nonsingular elliptic curve with function field $F=\F_q(E)$, and write $O$ for the unique point at infinity. Fix an integer $k\ge 3$, choose $n$ distinct rational points

$D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$

choose an integer $\ell$ satisfying

$0\;\le\;\ell\;\le \begin{cases} \frac{k-3}2,&k\text{ odd},\[4pt] \frac{k}2,&k\text{ even}, \end{cases}$

and select a nonzero twist parameter $\eta\in\F_q^*$ (Liu et al., 3 Sep 2025).

In affine coordinates $E/\F_q$0, or $E/\F_q$1 when $E/\F_q$2, the construction uses the fact that $E/\F_q$3 and that $E/\F_q$4 has basis

$E/\F_q$5

For odd $E/\F_q$6, the one-twist defining set $E/\F_q$7 is

$E/\F_q$8

with an analogous definition for even $E/\F_q$9. The paper states that $F=\F_q(E)$0.

The associated TECC is the evaluation code

$F=\F_q(E)$1

This construction preserves the standard AG-code paradigm of evaluation on rational points while introducing a single twist term controlled by $F=\F_q(E)$2 and $F=\F_q(E)$3. A plausible implication is that the twist is designed to perturb the ambient function space without changing its dimension, thereby enabling code families with structural properties not shared by classical elliptic curve codes.

2. Basic parameters and minimum distance

The length of $F=\F_q(E)$4 is $F=\F_q(E)$5, and its dimension is $F=\F_q(E)$6 (Liu et al., 3 Sep 2025). By Goppa’s bound,

$F=\F_q(E)$7

The paper strengthens this lower bound by proving that the minimum distance can assume only three values: $F=\F_q(E)$8 It then gives exact criteria for each case: $F=\F_q(E)$9 where $O$0 is the usual subset-sum count in the group $O$1.

These conditions place the distance problem at the intersection of divisor theory and the group structure of $O$2. The appearance of $O$3 indicates that the extremal behavior of the code depends not only on the degree of the divisor but also on additive configurations of the evaluation points on the elliptic curve. This suggests that TECCs inherit the arithmetic sensitivity of elliptic curve codes while adding twist-dependent obstructions through the parameter $O$4.

3. Dual codes and explicit parity-check matrices

A central structural result is the explicit determination of parity-check matrices through Weil differentials. Let

$O$5

be a local uniformizer, and define the canonical differential

$O$6

In the odd-characteristic model $O$7, the paper shows that

$O$8

Using Serre duality, or equivalently the standard AG-code duality formula, one obtains

$O$9

The relevant Riemann–Roch space admits the basis

$k\ge 3$0

Accordingly, the rows of a parity-check matrix can be written in block form as

$k\ge 3$1

and, after substituting $k\ge 3$2, the paper gives the fully explicit form

$k\ge 3$3

The significance of this description is methodological as well as structural. In classical AG coding theory, dual codes are often described abstractly through divisors and differentials; here, the paper pushes the description to an explicit matrix level. This makes the duality theory directly usable for parameter verification and for the study of self-duality.

4. Euclidean self-duality

The paper introduces a scaling vector $k\ge 3$4 and defines the scaled code $k\ge 3$5 by

$k\ge 3$6

For one-twist TECCs with $k\ge 3$7, Theorem 9 gives a complete characterization of Euclidean self-duality (Liu et al., 3 Sep 2025).

The code is Euclidean self-dual if and only if

$k\ge 3$8

and simultaneously there exists $k\ge 3$9 such that

$n$0

These two equations are necessary and sufficient for

$n$1

The first condition couples the twist parameter $n$2 to explicit residue-weighted sums of curve coordinates, while the second imposes a quadratic compatibility on the scaling vector. This identifies self-duality not as a generic feature of the construction, but as a constrained arithmetic phenomenon depending on the evaluation set, the residues of the chosen differential, and the twist. A plausible implication is that TECCs provide a controlled framework in which self-dual AG codes can be produced by solving explicit algebraic conditions rather than relying solely on existential arguments.

5. Examples and extremal behavior

The paper provides concrete examples of MDS, AMDS, self-dual and MDS self-dual TECCs (Liu et al., 3 Sep 2025). These examples instantiate the general theory and show that the one-twist construction can realize several standard optimality notions.

Type	Parameters and field	Defining data
MDS self-dual	$n$3 over $n$4	$n$5, $n$6, $n$7, $n$8, $n$9, and $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$0 chosen so that $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$1
AMDS near-MDS	$D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$2 over $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$3	$D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$4, $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$5, $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$6, twist $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$7

In the first example, the resulting $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$8 code is both MDS and self-dual. In the second, one checks that $D=P_1+\cdots+P_n,\quad P_i\in E(\F_q)\setminus\{O\},$9, so the code is almost-MDS but not MDS. The paper also states that numerous further MDS, AMDS, self-dual and MDS self-dual examples are given in Sections 5–6 by carrying out the group-sum criteria $\ell$0 and related conditions.

These examples are significant because they show that the twist mechanism does not merely perturb known AG constructions but can be tuned to preserve or create extremal metric and duality properties. This suggests that the family is broad enough to interpolate between classical elliptic-curve behavior and genuinely new code structures.

6. Schur square and non-equivalence

Let $\ell$1 denote the component-wise Schur square. Theorem 14 shows that for

$\ell$2

the one-twist TECCs satisfy

$\ell$3

By contrast, any $\ell$4-dimensional GRS code or elliptic curve code satisfies

$\ell$5

(Liu et al., 3 Sep 2025).

From this, the paper concludes that for $\ell$6, the TECCs cannot be monomially equivalent to any GRS code or classical elliptic curve code; likewise, their duals are excluded when $\ell$7. This is one of the strongest structural distinctions established in the paper. Rather than relying on informal intuition that a twist should generate a new family, the argument uses a Schur-square invariant to separate TECCs from two of the most prominent evaluation-code classes.

This addresses a common potential misconception: although TECCs are built from elliptic curves and evaluation maps, they are not merely reparameterized elliptic curve codes. In the parameter range covered by the theorem, the Schur-square dimension provides a formal obstruction to monomial equivalence. A plausible implication is that the twist changes the multiplicative profile of the code in a way that is invisible to basic parameters such as length and dimension but detectable through higher-order invariants.

7. Position within algebraic–geometric coding theory

The one-twist TECC construction sits within AG coding theory but is explicitly framed as an extension motivated by twisted generalized Reed-Solomon codes (Liu et al., 3 Sep 2025). Its defining features are the use of a modified $\ell$8-dimensional subspace $\ell$9, the explicit dual description via Weil differentials, the exact minimum-distance trichotomy $0\;\le\;\ell\;\le \begin{cases} \frac{k-3}2,&k\text{ odd},\[4pt] \frac{k}2,&k\text{ even}, \end{cases}$0, the necessary and sufficient self-duality conditions for the case $0\;\le\;\ell\;\le \begin{cases} \frac{k-3}2,&k\text{ odd},\[4pt] \frac{k}2,&k\text{ even}, \end{cases}$1, and the Schur-square criterion establishing non-equivalence with GRS and classical elliptic curve codes.

Taken together, these results delineate TECCs as a distinct family of evaluation codes on elliptic curves. The construction retains the arithmetic and geometric apparatus of AG codes—divisors, Riemann–Roch spaces, rational points, residues, and duality via differentials—while altering the defining space by a single twist term. This suggests that TECCs provide a systematic way to enlarge the design space of elliptic-curve-based codes without abandoning the explicit algebraic structure that makes AG codes analyzable.