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

02/10/2018
by   Cunsheng Ding, et al.
0

Ovoids in (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 (3, 2^m) for all m which are from a family of irreducible cyclic codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2022

Several Families of Irreducible Constacyclic and Cyclic Codes

In this paper, several families of irreducible constacyclic codes over f...
research
04/16/2018

The Subfield Codes of Ovoid Codes

Ovoids in (3, (q)) have been an interesting topic in coding theory, comb...
research
04/13/2023

Linear Codes over ℜ^s,m=∑_ς=1^m v_m^ς-1𝒜_m-1, with v_m^m=v_m

The main objective of this paper is to extend the previously defined cod...
research
07/15/2022

Infinite families of cyclic and negacyclic codes supporting 3-designs

Interplay between coding theory and combinatorial t-designs has been a h...
research
07/01/2019

Mismatched Guesswork

We study the problem of mismatched guesswork, where we evaluate the numb...
research
06/15/2020

Modeling Joint Lives within Families

Family history is usually seen as a significant factor insurance compani...
research
11/19/2018

Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences

Let m be an even positive integer. A Boolean bent function f on m-1× is ...

Please sign up or login with your details

Forgot password? Click here to reset