Generalized Hamming weights of codes over the GH curve

Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

A generalized Hermitian curve over \(\mathbb{F}_{q^r}\) is given by the affine equation, \[ \sum_{i=0}^{r-1}y^{q^i}=\sum_{i=0}^{r-1}(x^{q^i+q^{i+1}}+\cdots+x^{q^i+q^{r-1}}). \] Given a generalized Hermitian curve, say \(\mathcal{GH}\), a divisor \(D\) with support on it and the divisor \(sP_{\infty}\), one can consider the algebraic geometric code \(C_s=C(\mathcal{GH},D,sP_{\infty})\). Under some technical conditions that involve \(s\) they provide several bounds on the generalized minimum distance \(d_{\ell}(C_s)\). For some special values of \(s\) and \(\ell\) the bound is sharp. Finally they give an example where they compute the complete weight hierarchy.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514528)