Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchm\'aros curve
Combinatorics
2018-02-12 v1 Information Theory
math.IT
Abstract
In this paper we investigate the number of minimum weight codewords of some dual Algebraic-Geometric codes associated with the Giulietti-Korchm\'aros maximal curve, by computing the maximal number of intersections between the Giulietti-Korchm\'aros curve and lines, plane conics and plane cubics.
Cite
@article{arxiv.1802.03359,
title = {Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchm\'aros curve},
author = {Daniele Bartoli and Matteo Bonini},
journal= {arXiv preprint arXiv:1802.03359},
year = {2018}
}