Geertrui Van de Voorde

dblp:94/3696 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0002-4957-6911ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 11 · 4 since 2021
YearPublicationVenuePosition
2026 On certain blocking sets and the minimum weight of the code of generalised polygons
Sebastian Petit, Geertrui Van de Voorde
Des. Codes Cryptogr.2
2025 On the equivalence, stabilisers, and feet of Buekenhout-Tits unitals
abstract
Abstract This paper addresses a number of problems concerning Buekenhout-Tits unitals in $${{\,\textrm{PG}\,}}(2, q^2)$$ PG ( 2 , q 2 ) , where $$q = 2^{2e + 1}$$ q = 2 2 e + 1 and $$e \ge 1$$ e ≥ 1 . We show that all Buekenhout-Tits unitals are equivalent under $${{\,\textrm{PGL}\,}}(3, q^2)$$ PGL ( 3 , q 2 ) [addressing an open problem in Barwick and Ebert (Unitals in Projective Planes. Springer Monographs in Mathematics. Springer, New York, 2008)], explicitly describe their stabiliser in $$\textrm{P}\Gamma \textrm{L}(3, q^2)$$ P Γ L ( 3 , q 2 ) [expanding Ebert’s work in Ebert (J Algebraic Comb 6(2):133–140, 1997)], and show that lines meet the feet of points not on $$\ell _{\infty }$$ ℓ ∞ in at most four points. Finally, we show that feet of points not on $$\ell _{\infty }$$ ℓ ∞ are not always a $$\{0, 1, 2, 4\}$$ { 0 , 1 , 2 , 4 } -set, in contrast to what happens for Buekenhout-Metz unitals Abarzúa et al (Adv Geom 18(2):229–236, 2018).
Jake Faulkner, Geertrui Van de Voorde
Des. Codes Cryptogr.2
2023 Embedded antipodal planes and the minimum weight of the dual code of points and lines in projective planes of order p2
Maarten De Boeck, Geertrui Van de Voorde
Des. Codes Cryptogr.2
2022 The geometric field of linearity of linear sets
abstract
Abstract If an $${\mathbb {F}}_q$$ F q -linear set $$L_U$$ L U in a projective space is defined by a vector subspace U which is linear over a proper superfield of $${\mathbb {F}}_{q}$$ F q , then all of its points have weight at least 2. It is known that the converse of this statement holds for linear sets of rank h in $$\mathrm {PG}(1,q^h)$$ PG ( 1 , q h ) but for linear sets of rank $$k k < h the converse of this statement is in general no longer true. The first part of this paper studies the relation between the weights of points and the size of a linear set, and introduces the concept of the geometric field of linearity of a linear set. This notion will allow us to show the main theorem, stating that for particular linear sets without points of weight 1, the converse of the above statement still holds as long as we take the geometric field of linearity into account.
Dibyayoti Jena, Geertrui Van de Voorde
Des. Codes Cryptogr.2
2020 Rank-metric codes, linear sets, and their duality
John Sheekey, Geertrui Van de Voorde
Des. Codes Cryptogr.2
2017 On the maximality of a set of mutually orthogonal Sudoku Latin Squares
Jozefien D'haeseleer, Klaus Metsch, Leo Storme, Geertrui Van de Voorde
Des. Codes Cryptogr.4
2015 Linear representations of subgeometries
Stefaan De Winter, Sara Rottey, Geertrui Van de Voorde
Des. Codes Cryptogr.3
2013 A small minimal blocking set in PG(n, pt), spanning a (t-1)-space, is linear
Péter Sziklai, Geertrui Van de Voorde
Des. Codes Cryptogr.2
2010 On linear sets on a projective line
Michel Lavrauw, Geertrui Van de Voorde
Des. Codes Cryptogr.2
2008 Small weight codewords in the codes arising from Desarguesian projective planes
Veerle Fack, Szabolcs L. Fancsali, Leo Storme, Geertrui Van de Voorde, Joost Winne
Des. Codes Cryptogr.4
2008 On the code generated by the incidence matrix of points and hyperplanes in PG(n, q) and its dual
Michel Lavrauw, Leo Storme, Geertrui Van de Voorde
Des. Codes Cryptogr.3