On geometric Goppa codes from elementary abelian \(p\)-extensions of \(\mathbb{F}_{p^s}(x)\) (Q2211177)

For a finite field \(\mathbb F_{p^s}\) with \(p\) a prime integer, \(0\neq \mu\in{\mathbb F}_{p^s}\) and \(q\) be a power of \(p\), assume that the polynomial \(y^q+\mu y\) splits in \({\mathbb F}_{p^s}\). For a positive integer \(m<p^s\) coprime with \(p\) choose \(m\) distinct elements \(\alpha_i\in{\mathbb F}_{p^s}\) and for \(f(x)=\prod_{i=1}^m(x-\alpha_i)\) consider the projective curve over \({\mathbb F}_{p^s}\) given by the homogenization of the polynomial \(y^q+\mu y-f(x)\in {\mathbb F}_{p^s}[x,y]\). This is a weak Castle curve in the sense of [\textit{C. Munuera} et al., Adv. Math. Commun. 3, No. 4, 399--408 (2009; Zbl 1196.94093)] and the function field of this curve is an elementary abelian \(p\)-extension \(F\) of \({\mathbb F}_{p^s}\) by Proposition 6.4.1 in [\textit{H. Stichtenoth}, Algebraic function fields and codes. 2nd ed. Berlin: Springer (2009; Zbl 1155.14022)]. In this paper, the authors consider one-point geometric Goppa codes \(C_r\) over the function field \(F\), for the divisor \(rQ_{\infty}\) with \(r\) an integer. Their results include the computation of the dimension of the code for some values of \(r\) and a bound on its minimum distance for the same values of \(r\) in Theorems 6 and 7. Moreover, for some values of \(r\) they obtain bounds, and in some cases exact values, for the higher weights of the codes \(C_r\) and again in some cases the authors determine when \(C_r\) is a (quasi)-self-dual code. As applications, the authors obtain families of quantum codes, convolutional codes, and locally recoverable codes starting with the one-point geometric Goppa codes \(C_r\).