Affine variety codes over a hyperelliptic curve

DOI10.1134/S0032946021010051MaRDI QIDQ2021840zbMATH OpenOpenAlexFDO

Authors N. Patanker, Sanjay Kumar Singh

Publication date 27 April 2021

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946021010051

zbMATH Keywords

affine variety codesgeneralized Hamming weightsGröbner basishyperelliptic curvesymbol-pair distance

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

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\).

Recommendations

• Parameters of the codes over affine varieties
• From primary to dual affine variety codes over the Klein quartic
• Bounding the minimum distance of affine variety codes using symbolic computations of footprints
• On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve
• The generalized Hamming weights of some hyperelliptic codes

Cites work

• Codes for Symbol-Pair Read Channels
• Decoding affine variety codes using Gröbner bases
• Evaluation codes from an affine variety code perspective
• Evaluation codes from order domain theory
• Generalized Hamming weights for linear codes
• On affine variety codes from the Klein quartic
• The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
• The weight distribution of linear codes over GF(q^l) having generator matrix over GF(q)

Cited in

(7)

• Parameters of the codes over affine varieties
• Bounding the minimum distance of affine variety codes using symbolic computations of footprints
• On affine variety codes from the Klein quartic
• From primary to dual affine variety codes over the Klein quartic
• Quaternary affine variety codes over a Klein-like curve
• On the generalized Hamming weights of hyperbolic codes
• High dimensional affine codes whose square has a designed minimum distance

Describes a project that uses

Uses Software

• Code Tables

This page was built for publication: Affine variety codes over a hyperelliptic curve

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2021840)