Jan De Beule

dblp:96/6052 · DBLP profile ↗
← Back
16ranked-venue papers
12as first author
2since 2021 · last 2025
0000-0001-5333-5224ORCID · verified

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

Security and privacy · 15 · 12 first-author · 2 since 2021Theory of computation · 1
YearPublicationVenuePosition
2025 On two non-existence results for Cameron-Liebler k-sets in ${{\,\mathrm{\textrm{PG}}\,}}(n,q)$
Jan De Beule, Jonathan Mannaert, Leo Storme
Des. Codes Cryptogr.1
2022 Cameron-Liebler k-sets in subspaces and non-existence conditions
Jan De Beule, Jonathan Mannaert, Leo Storme
Des. Codes Cryptogr.1
2019 On the cylinder conjecture
Jan De Beule, Jeroen Demeyer, Sam Mattheus, Péter Sziklai
Des. Codes Cryptogr.1
2017 On Subsets of the Normal Rational Curve
abstract
A normal rational curve of the (k - 1)-dimensional projective space over Fq is an arc of size q+1, since any k points of the curve span the whole space. In this paper, we will prove that if q is odd, then a subset of size 3k -6 of a normal rational curve cannot be extended to an arc of size q +2. In fact, we prove something slightly stronger. Suppose that q is odd and E is a (2k - 3)-subset of an arc G of size 3k - 6. If G projects to a subset of a conic from every (k - 3)-subset of E, then G cannot be extended to an arc of size q + 2. Stated in terms of errorcorrecting codes we prove that a k-dimensional linear maximum distance separable code of length 3k - 6 over a field Fq of odd characteristic, which can be extended to a Reed-Solomon code of length q +1, cannot be extended to a linear maximum distance separable code of length q + 2.
Simeon Ball, Jan De Beule
IEEE Trans. Inf. Theory2
2016 A new family of tight sets in Q+(5, q)
Jan De Beule, Jeroen Demeyer, Klaus Metsch, Morgan Rodgers
Des. Codes Cryptogr.1
2014 Editorial: Special issue on finite geometries in honor of Frank De Clerck
John Bamberg, Jan De Beule, Nicola Durante, Michel Lavrauw
Des. Codes Cryptogr.2
2013 On large maximal partial ovoids of the parabolic quadric Q(4, q)
Jan De Beule
Des. Codes Cryptogr.1
2012 On sets of vectors of a finite vector space in which every subset of basis size is a basis II
Simeon Ball, Jan De Beule
Des. Codes Cryptogr.2
2012 A characterisation result on a particular class of non-weighted minihypers
Jan De Beule, Anja Hallez, Leo Storme
Des. Codes Cryptogr.1
2010 In memoriam, András Gács
Simeon Ball, Jan De Beule, Leo Storme, Péter Sziklai, Tamás Szonyi
Des. Codes Cryptogr.2
2010 Galois geometries and applications
Jan De Beule, Yves Edel, Emilia Käsper, Andreas Klein 0001, Svetla Nikova, Bart Preneel, Jeroen Schillewaert, Leo Storme
Des. Codes Cryptogr.1
2009 Tight sets, weighted m -covers, weighted m -ovoids, and minihypers
Jan De Beule, Patrick Govaerts, Anja Hallez, Leo Storme
Des. Codes Cryptogr.1
2008 Partial ovoids and partial spreads in hermitian polar spaces
Jan De Beule, Andreas Klein 0001, Klaus Metsch, Leo Storme
Des. Codes Cryptogr.1
2008 Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound
Jan De Beule, Klaus Metsch, Leo Storme
Des. Codes Cryptogr.1
2007 Characterization results on small blocking sets of the polar spaces Q +(2 n + 1, 2) and Q +(2 n + 1, 3)
Jan De Beule, Klaus Metsch, Leo Storme
Des. Codes Cryptogr.1
2006 Blocking All Generators of Q+(2n + 1, 3), n ≥ 4
Jan De Beule, Leo Storme
Des. Codes Cryptogr.1