Michel Lavrauw

dblp:38/4439 · DBLP profile ↗
← Back
21ranked-venue papers
9as first author
8since 2021 · last 2026
0000-0003-0973-5807ORCID · verified

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

Security and privacy · 21 · 9 first-author · 8 since 2021
YearPublicationVenuePosition
2026 Linear complete symmetric rank-distance codes
Nour Alnajjarine, Michel Lavrauw
Des. Codes Cryptogr.2
2025 A classification of planes intersecting the Veronese surface over finite fields of even order
Nour Alnajjarine, Michel Lavrauw
Des. Codes Cryptogr.2
2025 Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes
Simeon Ball, Michel Lavrauw, Tabriz Popatia
Des. Codes Cryptogr.2
2025 Correction to: Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes
Simeon Ball, Michel Lavrauw, Tabriz Popatia
Des. Codes Cryptogr.2
2025 Finite geometries
Ilaria Cardinali, Michel Lavrauw, Klaus Metsch, Alexander Pott
Des. Codes Cryptogr.2
2023 Symplectic 4-dimensional semifields of order 84 and 94
abstract
Abstract We classify symplectic 4-dimensional semifields over $$\mathbb {F}_q$$ F q , for $$q\le 9$$ q ≤ 9 , thereby extending (and confirming) the previously obtained classifications for $$q\le 7$$ q ≤ 7 . The classification is obtained by classifying all symplectic semifield subspaces in $$\textrm{PG}(9,q)$$ PG ( 9 , q ) for $$q\le 9$$ q ≤ 9 up to K-equivalence, where $$K\le \textrm{PGL}(10,q)$$ K ≤ PGL ( 10 , q ) is the lift of $$\textrm{PGL}(4,q)$$ PGL ( 4 , q ) under the Veronese embedding of $$\textrm{PG}(3,q)$$ PG ( 3 , q ) in $$\textrm{PG}(9,q)$$ PG ( 9 , q ) of degree two. Our results imply the non-existence of non-associative symplectic 4-dimensional semifields for q even, $$q\le 8$$ q ≤ 8 . For q odd, and $$q\le 9$$ q ≤ 9 , our results imply that the isotopism class of a symplectic non-associative 4-dimensional semifield over $$\mathbb {F}_q$$ F q is contained in the Knuth orbit of a Dickson commutative semifield.
Michel Lavrauw, John Sheekey
Des. Codes Cryptogr.1
2022 Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics
Simeon Ball, Michel Lavrauw, Tamás Szonyi
Des. Codes Cryptogr.2
2022 Combinatorial invariants for nets of conics in $\mathrm {PG}(2, q)$
abstract
Abstract The problem of classifying linear systems of conics in projective planes dates back at least to Jordan, who classified pencils (one-dimensional systems) of conics over $${\mathbb {C}}$$ C and $$\mathbb {R}$$ R in 1906–1907. The analogous problem for finite fields $$\mathbb {F}_q$$ F q with q odd was solved by Dickson in 1908. In 1914, Wilson attempted to classify nets (two-dimensional systems) of conics over finite fields of odd characteristic, but his classification was incomplete and contained some inaccuracies. In a recent article, we completed Wilson’s classification (for q odd) of nets of rank one, namely those containing a repeated line. The aim of the present paper is to introduce and calculate certain combinatorial invariants of these nets, which we expect will be of use in various applications. Our approach is geometric in the sense that we view a net of rank one as a plane in $$\mathrm {PG}(5,q)$$ PG ( 5 , q ) , q odd, that meets the quadric Veronesean in at least one point; two such nets are then equivalent if and only if the corresponding planes belong to the same orbit under the induced action of $$\mathrm {PGL}(3,q)$$ PGL ( 3 , q ) viewed as a subgroup of $$\mathrm {PGL}(6,q)$$ PGL ( 6 , q ) . Since q is odd, the orbits of lines in $$\mathrm {PG}(5,q)$$ PG ( 5 , q ) under this action correspond to the aforementioned pencils of conics in $$\mathrm {PG}(2,q)$$ PG ( 2 , q ) . The main contribution of this paper is to determine the line-orbit distribution of a plane $$\pi $$ π corresponding to a net of rank one, namely, the number of lines in $$\pi $$ π belonging to each line orbit. It turns out that this list of invariants completely determines the orbit of $$\pi $$ π , and we will use this fact in forthcoming work to develop an efficient algorithm for calculating the orbit of a given net of rank one. As a more immediate application, we also determine the stabilisers of nets of rank one in $$\mathrm {PGL}(3,q)$$ PGL ( 3 , q ) , and hence the orbit sizes.
Michel Lavrauw, Tomasz Popiel, John Sheekey
Des. Codes Cryptogr.1
2020 Arcs and tensors
Simeon Ball, Michel Lavrauw
Des. Codes Cryptogr.2
2019 Preface to the special issue on finite geometries
Ilaria Cardinali, Michel Lavrauw, Klaus Metsch, Alexander Pott
Des. Codes Cryptogr.2
2017 The BEL-rank of finite semifields
Michel Lavrauw, John Sheekey
Des. Codes Cryptogr.1
2016 Editorial: finite geometries
Dina Ghinelli, Dieter Jungnickel, Michel Lavrauw, Alexander Pott
Des. Codes Cryptogr.3
2016 On BEL-configurations and finite semifields
Michel Lavrauw, John Sheekey
Des. Codes Cryptogr.1
2015 On embeddings of minimum dimension of PG(n, q) × PG(n, q)
Michel Lavrauw, John Sheekey, Corrado Zanella
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.4
2013 Finite semifields and nonsingular tensors
Michel Lavrauw
Des. Codes Cryptogr.1
2010 On linear sets on a projective line
Michel Lavrauw, Geertrui Van de Voorde
Des. Codes Cryptogr.1
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.1
2007 On the Hughes-Kleinfeld and Knuth's semifields two-dimensional over a weak nucleus
Simeon Ball, Michel Lavrauw
Des. Codes Cryptogr.2
2006 Sublines of Prime Order Contained in the Set of Internal Points of a Conic
Michel Lavrauw
Des. Codes Cryptogr.1
2004 Symplectic Spreads
Simeon Ball, John Bamberg, Michel Lavrauw, Tim Penttila
Des. Codes Cryptogr.3