Differential Goppa Codes

Abstract

Rosenbloom and Tsfasman, in their foundational work on the $m$-metric, introduced algebraic-geometric codes defined by multiple points on a smooth projective curve $X$. This construction involves a divisor $G$ and another divisor $D=\sum n p_i$, where $p_i$ are distinct rational points with $p_i \notin \text{supp}(G)$ and $n\in\mathbb{N}$. Although these codes are significant, their formal development for arbitrary genus remains incomplete in the literature, as most studies have concentrated on the genus $0$ case. We present a rigorous treatment of this class of codes. Starting with a smooth projective curve $X$, an invertible sheaf $L$, and an effective divisor $D=\sum n_i p_i$ where the $n_i$ are not necessarily equal, as well as tuples of uniformizers $t_D$ at the points of $D$ and trivializations $γ_D$ for the localizations $L_{p_i}$, the associated differential Goppa code is defined. This code arises from the theory of $n$-jets of invertible sheaves on curves, which enables the description of codewords using Hasse-Schmidt derivatives of sections of $L$. The variation of the code under changes in the data $(t_D, γ_D)$ is examined, and the group acting on these parameters is described. The behavior of the minimum Hamming distance under such variations is analyzed, with explicit examples provided for curves of genus $0$ and $1$. A duality theorem is established, involving principal parts of meromorphic differential forms. It is demonstrated that Goppa codes constitute a proper subclass of differential Goppa codes, and that every linear code admits a differential Goppa code structure on $\mathbb P^1$ using only two rational points.

Theorems & Definitions (87)

• Definition 3.1
• Lemma 3.2
• Remark 3.3
• proof
• Definition 3.4
• Remark 3.5
• Lemma 3.6
• proof
• Remark 3.7
• Lemma 3.8