English

Maximal arcs and extended cyclic codes

Combinatorics 2017-12-04 v1

Abstract

It is proved that for every d2d\ge 2 such that d1d-1 divides q1q-1, where qq is a power of 2, there exists a Denniston maximal arc AA of degree dd in \PG(2,q)\PG(2,q), being invariant under a cyclic linear group that fixes one point of AA and acts regularly on the set of the remaining points of A{A}. 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}
}
R2 v1 2026-06-22T23:03:13.441Z