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

02/09/2018
by   Daniele Bartoli, et al.
0

In this paper we investigate the number of minimum weight codewords of some dual Algebraic-Geometric codes associated with the Giulietti-Korchmáros maximal curve, by computing the maximal number of intersections between the Giulietti-Korchmáros curve and lines, plane conics and plane cubics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2019

On the weights of dual codes arising from the GK curve

In this paper we investigate some dual algebraic-geometric codes associa...
research
06/28/2021

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

In this paper we investigate two-point algebraic-geometry codes (AG code...
research
11/16/2015

Resolving the Geometric Locus Dilemma for Support Vector Learning Machines

Capacity control, the bias/variance dilemma, and learning unknown functi...
research
05/22/2023

Geometric Facts Underlying Algorithms of Robot Navigation for Tight Circumnavigation of Group Objects through Singular Inter-Object Gaps

An underactuated nonholonomic Dubins-vehicle-like robot with a lower-lim...
research
05/25/2018

Invariants of graph drawings in the plane

We present a simplified exposition of some classical and modern results ...
research
09/15/2021

Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model

We present subquadratic algorithms in the algebraic decision-tree model ...
research
02/19/2020

Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties

In this article, we consider Schubert codes, linear codes associated to ...

Please sign up or login with your details

Forgot password? Click here to reset