Maximal arcs and extended cyclic codes
Combinatorics
2017-12-04 v1
Abstract
It is proved that for every such that divides , where is a power of 2, there exists a Denniston maximal arc of degree in , being invariant under a cyclic linear group that fixes one point of and acts regularly on the set of the remaining points of . Two alternative proofs are given, one geometric proof based on Abatangelo-Larato's characterization of Denniston arcs, and a second coding-theoretical proof based on cyclotomy and the link between maximal arcs and two-weight codes.
Keywords
Cite
@article{arxiv.1712.00137,
title = {Maximal arcs and extended cyclic codes},
author = {Stefaan De Winter and Cunsheng Ding and Vladimir D. Tonchev},
journal= {arXiv preprint arXiv:1712.00137},
year = {2017}
}