Two-Point Codes for the Generalized GK Curve

@article{Barelli2018TwoPointCF,
  title={Two-Point Codes for the Generalized GK Curve},
  author={{\'E}lise Barelli and Peter Beelen and Mrinmoy Datta and Vincent Neiger and Johan Sebastian Rosenkilde},
  journal={IEEE Transactions on Information Theory},
  year={2018},
  volume={64},
  pages={6268-6276}
}
We improve previously known lower bounds for the minimum distance of certain two-point AG codes constructed using a Generalized Giulietti–Korchmaros curve (GGK). Castellanos and Tizziotti recently described such bounds for two-point codes coming from the Giulietti–Korchmaros curve. Our results completely cover and in many cases improve on their results, using different techniques, while also supporting any GGK curve. Our method builds on the order bound for AG codes: to enable this, we study… 

Figures and Tables from this paper

Multi-point Codes from the GGS Curves

The Weierstrass semigroups and pure gaps are characterized explicitly and the floor of a certain type of divisor is determined and the properties of AG codes from GGS curves are investigated.

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

New Non-Equivalent (Self-Dual) MDS Codes From Elliptic Curves

New non-equivalent MDS and almost MDS codes from elliptic curve codes are constructed and the application to MDS entanglement-assisted quantum codes is given.

On the security of short McEliece keys from algebraic and algebraic geometry codes with automorphisms. (Étude de la sécurité de certaines clés compactes pour le schéma de McEliece utilisant des codes géométriques)

It is shown that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problems on the invariant code, and this result permits us to propose a security analysis of QC codes coming from the Hermitian curve.

References

SHOWING 1-10 OF 18 REFERENCES

Multi-point Codes from the GGS Curves

The Weierstrass semigroups and pure gaps are characterized explicitly and the floor of a certain type of divisor is determined and the properties of AG codes from GGS curves are investigated.

Two-Point AG Codes on the GK Maximal Curves

We determine the Weierstrass semigroup of a pair of certain rational points on the Giulietti-Korchmáros maximal curves. We use this semigroup to obtain two-point algebraic geometric (AG) codes with

One-Point AG Codes on the GK Maximal Curves

In this paper, algebraic-geometric (AG) codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the

Distance bounds for algebraic geometric codes

AG codes and AG quantum codes from the GGS curve

The Weierstrass semigroup at all Fq2-rational points of the curve is determined; the Feng-Rao designed minimum distance is computed for infinite families of such codes, as well as the automorphism group.

Weierstrass Pairs and Minimum Distance of Goppa Codes

We prove that elements of the Weierstrassgap set of a pair of points may be used to define a geometricGoppa code which has minimum distance greater than the usuallower bound. We determine the

Algebraic-Geometry Codes

Elements of the theory of algebraic curves, at a level sufficient to understand the code constructions and decoding algorithms, are introduced.

Consecutive Weierstrass gaps and minimum distance of Goppa codes

The automorphism group of the generalized Giulietti–Korchmáros function field

The Giulietti-Korchmaros (GK) function eld is the rst example of a maximal function eld which is not a subeld of the Hermitian function eld over the same constant eld. The generalized GK function

The order bound for general algebraic geometric codes

  • Peter Beelen
  • Computer Science, Mathematics
    Finite Fields Their Appl.
  • 2007