A family of ovoids in PG(3, 2^m) from cyclic codes

2018/02/10 by Cunsheng Ding, Ding, Cunsheng
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1802.03534

openalex publication_date 2018/02/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Ovoids in \PG(3, q) have been an interesting topic in coding theory, combinatorics, and finite geometry for a long time. So far only two families are known. The first is the elliptic quadratics and the second is the Tits ovoids. In this article, we present a family of ovoids in \PG(3, 2^m) for all m which are from a family of irreducible cyclic codes.

Related

• The Subfield Codes of Ovoid Codes
• Ovoids in the cyclic presentation of PG(3,q)
• Extended cyclic codes, maximal arcs and ovoids
• An infinite family of m-ovoids of Q(4,q)
• A family of m-ovoids of parabolic quadrics