DeepAI AI Chat
Log In Sign Up

Two-point AG codes from the Beelen-Montanucci maximal curve

by   Leonardo Landi, et al.

In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered.


page 1

page 2

page 3

page 4


Two-point AG codes from one of the Skabelund maximal curves

In this paper, we investigate two-point Algebraic Geometry codes associa...

On the weights of dual codes arising from the GK curve

In this paper we investigate some dual algebraic-geometric codes associa...

Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchmáros curve

In this paper we investigate the number of minimum weight codewords of s...

Steane-Enlargement of Quantum Codes from the Hermitian Curve

In this paper, we study the construction of quantum codes by applying St...

On nested code pairs from the Hermitian curve

Nested code pairs play a crucial role in the construction of ramp secret...

Quadratic-Curve-Lifted Reed-Solomon Codes

Lifted codes are a class of evaluation codes attracting more attention d...

Mumford representation and Riemann Roch space of a divisor on a hyperelliptic curve

For an (imaginary) hyperelliptic curve ℋ of genus g, with a Weierstrass ...