On Almost Complete Subsets of a Conic in \mathrm{PG}(2,q), Completeness of Normal Rational Curves and Extendability of Reed-Solomon Codes

MaRDI QIDQ6277664zbMATH OpenFDO

Authors Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco

Publication date 19 September 2016

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes and caps in Galois spaces (51E22) Linear codes (general theory) (94B05)

Abstract: A subset $mathcalS$ of a conic $mathcalC$ in the projective plane $mathrmPG(2,q)$ is called almost complete (AC-subset for short) if it can be extended to a larger arc in $mathrmPG(2,q)$ only by the points of $mathcalCsetminusmathcalS$ and by the nucleus of $mathcalC$ when $q$ is even. New upper bounds on the smallest size $t(q)$ of an AC-subset are obtained, in particular, �egin{align*} &t(q)<sqrt{q(3ln q+lnln q +ln3)}+sqrt{frac{q}{3ln q}}+4 hicksimsqrt{3qln q};&t(q)<1.835sqrt{qln q}.end{align*} The new bounds are used to increase regions of pairs $(N,q)$ for which it is proved that every normal rational curve in $mathrmPG(N,q)$ is a complete $(q+1)$-arc or, equivalently, that no $[q+1,N+1,q-N+1{]}_q$ generalized doubly-extended Reed-Solomon code can be extended to a $[q+2,N+1,q-N+2{]}_q$ MDS code.

This page was built for publication: On Almost Complete Subsets of a Conic in $\mathrm{PG}(2,q)$, Completeness of Normal Rational Curves and Extendability of Reed-Solomon Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6277664)