Extended cyclic codes, maximal arcs and ovoids
Kanat Abdukhalikov, Duy Ho

TL;DR
This paper explores the connection between extended cyclic codes over finite fields and geometric structures like hyperovals, maximal arcs, and ovoids, providing new characterizations and presentations of these objects.
Contribution
It establishes new links between specific classes of extended cyclic codes and geometric configurations such as hyperovals, maximal arcs, and ovoids, offering novel characterizations and simpler presentations.
Findings
Extended cyclic codes with parameters [q+2,3,q] determine regular hyperovals.
Codes with parameters [qt-q+t,3,qt-q] determine Denniston maximal arcs.
Codes with parameters [q^2+1,4,q^2-q] are equivalent to ovoid codes from elliptic quadrics.
Abstract
We show that extended cyclic codes over with parameters , , determine regular hyperovals. We also show that extended cyclic codes with parameters , , determine (cyclic) Denniston maximal arcs. Similarly, cyclic codes with parameters are equivalent to ovoid codes obtained from elliptic quadrics in . Finally, we give new simple presentations of Denniston maximal arcs in and elliptic quadrics in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
