Parameters of the codes over affine varieties (Q1425449)

Let \(V \) be an affine variety over \({\mathbb F}_q\) with \(n\) affine zeros \(P_1, \ldots, P_n\). For any polynomial \(h \in {\mathbb F}_q [x_1, \ldots, x_m ]\), regarded as a rational function on \(V\), denote the evaluation vector by \[ h:=(h(P_1), \ldots, h(P_n)). \] Suppose further that there is a total order on the set of all such polynomials. Let \(H = \{ h_1, \ldots, h_n \}\) be an ordered sequence of such polynomials (regarded as rational functions) such that \(h_1, \ldots, h_n\) are linearly independent over \({\mathbb F}_q\). Then, for every \(k\) satisfying \(1 \leq k \leq n\), let \(E_k\) denote the \(q\)-ary code generated by \(h_1, \ldots, h_k\). These codes are obviously of length \(n\) and dimension \(k\). In fact, this construction is a generalization of codes defined by well-behaving sequences and includes the weighted Reed-Muller codes and Reed-Muller codes as special cases. In this paper, the author analyzes the minimum distance and generalized Hamming weights of these codes. Under the additional condition that there exists a weighted degree function \(\rho\) on \({\mathbb F}_q [x_1 , \ldots, x_m ]/ I\), where \(I\) is the ideal corresponding to \(V\), such that \[ h_1 =1 \;{\text{ and }} \;\rho(h_1) < \rho(h_2) < \cdots < \rho (h_n), \] it is shown that the minimum distance of \(E_k\) is bounded below by \(n - \rho (h_k)\). If \(V\) is a curve with \(n\) affine rational points \(P_1, \ldots, P_n\) and another rational point \(P\) at infinity, and \(H =\{ h_1, \ldots, h_n \}\) is a sequence of polynomials such that every \(h_i\) has a unique pole at \(P\), then it is shown that the \(r\)th generalized Hamming weight of \(E_k\) is bounded below by \(n - \rho(h_k) + \gamma_r\), where \(\gamma_r\) is the \(r\)th gonality of the curve. The generalized Hamming weights of the dual code can also be readily obtained due to the duality of the generalized Hamming weights.