2000 character limit reached
Two-point AG codes from the Beelen-Montanucci maximal curve
Published 28 Jun 2021 in math.AG, cs.IT, and math.IT | (2106.14564v2)
Abstract: 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\"uneri-Stichtenoth (GGS) curve are discovered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
