|
This article is cited in 2 scientific papers (total in 2 papers)
Coding Theory
Affine variety codes over a hyperelliptic curve
N. Patanker, S. K. Singh Indian Institute of Science Education and Research, Bhopal, India
Abstract:
We estimate the minimum distance of primary monomial affine variety codes defined from a hyperelliptic curve ${x^5} + x - {y^2}$ over $\mathbb{F}_7$. To estimate the minimum distance of the codes, we apply symbolic computations implementing the techniques suggested by Geil and Özbudak. For some of these codes, we also obtain the symbol-pair distance. Furthermore, lower bounds on the generalized Hamming weights of the constructed codes are obtained. The proposed method to calculate the generalized Hamming weights can be applied to any primary monomial affine variety codes.
Keywords:
affine variety codes, Gröbner basis, hyperelliptic curve, generalized Hamming weights, symbol-pair distance.
Received: 11.09.2020 Revised: 14.01.2021 Accepted: 19.01.2021
Citation:
N. Patanker, S. K. Singh, “Affine variety codes over a hyperelliptic curve”, Probl. Peredachi Inf., 57:1 (2021), 96–111; Problems Inform. Transmission, 57:1 (2021), 84–97
Linking options:
https://www.mathnet.ru/eng/ppi2337 https://www.mathnet.ru/eng/ppi/v57/i1/p96
|
Statistics & downloads: |
Abstract page: | 100 | Full-text PDF : | 3 | References: | 17 | First page: | 10 |
|