Extended cyclic codes, maximal arcs and ovoids
نویسندگان
چکیده
We show that extended cyclic codes over $$\mathbb {F}_q$$ with parameters $$[q+2,3,q]$$ , $$q=2^m$$ determine regular hyperovals. also $$[qt-q+t,3,qt-q]$$ $$1<t<q$$ q is a power of t, (cyclic) Denniston maximal arcs. Similarly, $$[q^2+1,4,q^2-q]$$ are equivalent to ovoid obtained from elliptic quadrics in PG(3, q). Finally, we give simple presentations arcs PG(2, q) and
منابع مشابه
Cyclic arcs and pseudo-cyclic MDS codes
Cyclic arcs (defined by Storme and Van Maldghem, [1994]) and pseudocyclic MDS codes are equivalent objects. We survey known results on the existence of cyclic arcs. Some new results on cyclic arcs in PG(2, q) are also given.
متن کاملAlgebraic curves and maximal arcs
A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set K of the Desarguesian plane PG(2, q) is obtained. The case where K is a maximal (k, n)-arc is considered in greater depth.
متن کاملGroups of Maximal Arcs
Apart from hyperovals and their duals there are only three classes of maximal arcs known in Desarguesian projective planes. Two classes are due to J. A. Thas and one to R. H. F. Denniston. In this paper collineation stabiliser and isomorphism problems for those maximal arcs in Desarguesian projective planes are examined. The full collineation stabilisers of the known maximal arcs are calculated...
متن کاملA family of ovoids in PG(3, 2^m) from cyclic codes
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) for all m which are from a family of irreducible cyclic codes.
متن کاملMaximal Arcs in Desarguesian Planes
A ( k , n ) a r c in a projective plane is a set of k points, at most n on every line. If the order of the plane is q, then k < 1 + (q + 1) (n 1) = qn q + n with equality if and only if every line intersects the arc in 0 or n points. Arcs realizing the upper bound are called maximal arcs. Equality in the bound implies tha t n lq or n = q + l . If 1 < n < q, then the maximal arc is called non-tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2021
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-021-00915-2