English
Related papers

Related papers: Projective Two-Weight Sets of Denniston Type

200 papers

In this paper, we study the weight distributions of $\mathbb{F}_q$-linear sets in $\mathrm{PG}(1,q^5)$. Our main theorem proves that a linear set $S$ of rank $5$, which is not scattered has the following weight distribution for its points…

Combinatorics · Mathematics 2022-04-26 Maarten De Boeck , Geertrui Van de Voorde

In 1974, J. Thas constructed a new class of maximal arcs for the Desarguesian plane of order $q^2$. The construction relied upon the existence of a regular spread of tangent lines to an ovoid in $\PG(3,q)$ and, in particular, it does apply…

Combinatorics · Mathematics 2009-07-18 A. Aguglia , L. Giuzzi

In this paper we provide a generalization of the MPS construction of blocking sets of $PG(r,q^n)$ using subspaces of dimension $s\leq n-2$. By this construction, we determine a new non-planar example in $PG(3,q^6)$.

Combinatorics · Mathematics 2014-05-08 Simone Costa

An $\mathbb{F}_q$-linear set of rank $k$ on a projective line $\mathrm{PG}(1,q^h)$, containing at least one point of weight one, has size at least $q^{k-1}+1$ (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J.…

Combinatorics · Mathematics 2020-09-29 Dibyayoti Jena , Geertrui Van de Voorde

We introduce a family of linear sets of $\mathrm{PG}(1,q^{2n})$ arising from maximum scattered linear sets of pseudoregulus type of $\mathrm{PG}(3,q^{n})$. For $n=3,4$ and for certain values of the parameters we show that these linear sets…

Combinatorics · Mathematics 2017-07-27 Bence Csajbók , Giuseppe Marino , Olga Polverino , Corrado Zanella

We show that the metric dimension of a finite projective plane of order $q\geq 23$ is $4q-4$, and describe all resolving sets of that size. Let $\tau_2$ denote the size of the smallest double blocking set in $\mathrm{PG}(2,q)$, the…

Combinatorics · Mathematics 2017-01-31 Tamás Héger , Marcella Takáts

In [2] and [19] are presented the first two families of maximum scattered $\mathbb{F}_q$-linear sets of the projective line $\mathrm{PG}(1,q^n)$. More recently in [23] and in [5], new examples of maximum scattered $\mathbb{F}_q$-subspaces…

Combinatorics · Mathematics 2017-09-05 Bence Csajbók , Giuseppe Marino , Ferdinando Zullo

In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $N\leq q+1$ (for $q$ odd) or $N\leq q+2$ (for $q$ even), using a set of non--degenerate Hermitian forms in $PG(2,q^2)$.

Information Theory · Computer Science 2009-07-19 A. Aguglia , L. Giuzzi

In this work complete caps in $PG(N,q)$ of size $O(q^{\frac{N-1}{2}}\log^{300} q)$ are obtained by probabilistic methods. This gives an upper bound asymptotically very close to the trivial lower bound $\sqrt{2}q^{\frac{N-1}{2}}$ and it…

Combinatorics · Mathematics 2014-06-20 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

A $(p,q)$-ary chain is a special type of chain partition of integers with parts of the form $p^aq^b$ for some fixed integers $p$ and $q$. In this note, we are interested in the maximal weight of such partitions when their parts are distinct…

Number Theory · Mathematics 2013-10-23 Filippo Disanto , Laurent Imbert , Fabrice Philippe

In this paper, we study the p-ary linear code C(PG(n, q)), q = p^h, p prime, h >= 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small…

Combinatorics · Mathematics 2012-01-17 Michel Lavrauw , Leo Storme , Geertrui Van de Voorde

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Group Theory · Mathematics 2009-01-14 Alireza Abdollahi

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

Combinatorics · Mathematics 2026-03-31 Tim Alderson , Simeon Ball

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

The subject of this paper is the study of small complete arcs in $\mathrm{PG}(2,q)$, for $q$ odd, with at least $(q+1)/2$ points on a conic. We give a short comprehensive proof of the completeness problem left open by Segre in his seminal…

Combinatorics · Mathematics 2021-05-25 Gülizar Günay , Michel Lavrauw

A {\em pseudo-arc} in $\mathrm{PG}(3n-1,q)$ is a set of $(n-1)$-spaces such that any three of them span the whole space. A pseudo-arc of size $q^n+1$ is a {\em pseudo-oval}. If a pseudo-oval $\mathcal{O}$ is obtained by applying field…

Combinatorics · Mathematics 2015-12-16 Tim Penttila , Geertrui Van de Voorde

Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial…

Information Theory · Computer Science 2022-07-26 Jiaxin Wang , Zexia Shi , Yadi Wei , Fang-Wei Fu

In this paper we prove the existence of a complete cap of ${\rm PG}(4n+1, q)$ of size $2(q^{2n+1}-1)/(q-1)$, for each prime power $q>2$. It is obtained by projecting two disjoint Veronese varieties of ${\rm PG}(2n^2+3n, q)$ from a suitable…

Combinatorics · Mathematics 2021-06-01 Antonio Cossidente , Bence Csajbók , Giuseppe Marino , Francesco Pavese

A \textit{k}-arc in the projective space ${\rm PG}(n,q)$ is a set of $k$ projective points such that no subcollection of $n+1$ points is contained in a hyperplane. In this paper, we construct new $60$-arcs and $110$-arcs in ${\rm PG}(4,q)$…

Combinatorics · Mathematics 2018-10-04 Torger Olson , Eric Swartz

We use polynomial techniques to derive structural results on R\'edei type blocking sets from information on their bisecants. We apply our results to point sets of $PG(2,q)$ with few odd-secants. In particular, we improve the lower bound of…

Combinatorics · Mathematics 2016-07-26 Bence Csajbók