Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve (Q514528): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3934/amc.2017006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2588481600 / rank | |||
Normal rank |
Revision as of 20:24, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve |
scientific article |
Statements
Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve (English)
0 references
9 March 2017
0 references
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.
0 references
generalized Hamming weights
0 references
\(\mathcal{GH}\) curve
0 references