Affine variety codes over a hyperelliptic curve (Q2021840)

Affine variety codes are a class of codes defined by evaluating multivariate polynomials at the points of an affine variety. Such codes constitute have been proved to represent the entire class of linear codes. Given an affine variety code, it is quite easy to determine its length and dimension. Still, it isn't not known a simple general method to estimate its minimum distance and generalized Hamming weights. In this paper, the authors extend the techniques developed in [\textit{O. Geil} and \textit{F. Özbudak}, Cryptogr. Commun. 11, No. 2, 237--257 (2019; Zbl 1409.94874)] to compute lower bounds for the generalized Hamming weights of affine variety codes obtained from the hyperelliptic curve \(x^5+x-y^2\) over \(\mathbb{F}_7\).