Linear codes from Denniston maximal arcs
Combinatorics
2017-11-30 v1 Algebraic Geometry
Abstract
In this paper we construct functional codes from Denniston maximal arcs. For we obtain linear codes with parameters where . We also find for a number of linear codes which appear to have larger minimum distance with respect to the known codes with same length and dimension.
Keywords
Cite
@article{arxiv.1711.10478,
title = {Linear codes from Denniston maximal arcs},
author = {Daniele Bartoli and Massimo Giulietti and Maria Montanucci},
journal= {arXiv preprint arXiv:1711.10478},
year = {2017}
}