Affine variety codes over a hyperelliptic curve (Q2021840)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Affine variety codes over a hyperelliptic curve |
scientific article |
Statements
Affine variety codes over a hyperelliptic curve (English)
0 references
27 April 2021
0 references
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\).
0 references
affine variety codes
0 references
Gröbner basis
0 references
hyperelliptic curve
0 references
generalized Hamming weights
0 references
symbol-pair distance
0 references
0 references