The weight hierarchy of decreasing norm-trace codes (Q6944912)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8078148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The weight hierarchy of decreasing norm-trace codes |
scientific article; zbMATH DE number 8078148 |
Statements
The weight hierarchy of decreasing norm-trace codes (English)
0 references
11 August 2025
0 references
Let \(\mathbb{F}_q\) be a finite field with \(q\) elements. For any integer \(s\ge 2\), polynomials \(N(x)=x^{\frac{q^s-1}{q-1}}\) and \(Tr(y)=y^{q^{s-1}}+\cdots+y^q+y\) belong to the ring \(F_{q^s}[x,y]\). For any \(\alpha\in \mathbb{F}_{q^s}\), the functional values \(N(\alpha)\) and \(\text{Tr}(\alpha)\) are called norm and trace respectively with respect to the extension \(\mathbb{F}_q/\mathbb{F}_q\). The norm-trace function, denoted by \(\chi\), is the affine plane curve over \(\mathbb{F}_{q^s}\), given by \(N(x)=Tr(y)\). The extended norm-trace, denoted by \(\chi_u\), is defined by \(x^u= \text{Tr}(y)\) for any \(u|\frac{q^s-1}{q-1}\). For \(n=u(q-1)q^{s-1}+q^{s-1}\), the evaluation map, denoted by \(\operatorname{ev}\), is the \(\mathbb{F}_{q^s}\)-linear map given by \(\operatorname{ev}:\mathbb{F}_{q^s}[x,y]\to\mathbb{F}_{q^s}^n\) such that \(\operatorname{ev}(f)=(f(P_1),\dots, f(P_n))\). For a given \(f\in \mathbb{F}_{q^s}[x,y]\), the decreasing norm-trace code is defined by evaluating monomials on the rational points of \(\chi_u=\{P_1,\dots, P_n\} \subseteq \mathbb{F}_{q^s}^2\).\N\NIn this paper, the authors determine the generalized Hamming weights of extended norm-trace codes. They obtain the weight hierarchy of decreasing norm-trace codes. They first study the generalized Hamming weights of some Reed-Muller-type codes over the norm-trace curve and, then obtain bounds for the relative generalized Hamming weights. In addition, the authors discuss some applications of the first relative generalized Hamming weights of the nested pair of codes to construct quantum codes and give an example to illustrate that how to obtain asymmetric quantum codes with good parameters using one-point codes over the norm-trace curve.
0 references
evaluation codes
0 references
decreasing monomial codes
0 references
norm-trace curves
0 references
generalized Hamming weights
0 references
one-point algebraic geometry codes
0 references
quantum codes
0 references
footprint bound
0 references
0 references
0 references
0 references