My main research interest is finite projective geometry. In particular, I study the interplay between the combinatorial properties of particular sets and their algebraic description. Moreover, I am interested in the links between finite geometry and other areas. Many open problems in coding theory can be translated into a purely geometrical problem. Similarly, examples of (extremal) graphs often arise from finite geometry.
- D’haeseleer J., Metsch K., Storme L. and Van de Voorde G. (2017) On the maximality of a set of mutually orthogonal Sudoku Latin Squares. Designs, Codes and Cryptography 84(1-2): 143-152. http://dx.doi.org/10.1007/s10623-016-0234-3.
- De Beule J., Heger T., Szonyi T. and Van de Voorde G. (2016) Blocking and double blocking sets in finite planes. The Electronic Journal of Combinatorics 23 2
- De Boeck M. and Van de Voorde G. (2016) A linear set view on KM-arcs. Journal of Algebraic Combinatorics 44 1: 131-164. http://dx.doi.org/10.1007/s10801-015-0661-7.
- Van de Voorde G. (2016) Constructing Minimal Blocking Sets Using Field Reduction. Journal of Combinatorial Designs 24 1: 36-52. http://dx.doi.org/10.1002/jcd.21432.
- Van de Voorde G. (2016) Desarguesian spreads and field reduction for elements of the semilinear group. Linear Algebra and its Applications 507: 96-120. http://dx.doi.org/10.1016/j.laa.2016.05.038.