Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeertrui Van de Voorde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j31]Maarten De Boeck, Geertrui Van de Voorde
:
Embedded antipodal planes and the minimum weight of the dual code of points and lines in projective planes of order p2. Des. Codes Cryptogr. 91(3): 895-920 (2023)- [j30]Lins Denaux, Jozefien D'haeseleer, Geertrui Van de Voorde:
A higgledy-piggledy set of planes based on the ABB-representation of linear sets. Discret. Math. 346(12): 113603 (2023) - 2022
- [j29]Michel Lavrauw, Geertrui Van de Voorde:
Locally repairable codes with high availability based on generalised quadrangles. Adv. Math. Commun. 16(1): 73-81 (2022) - [j28]Dibyayoti Jena, Geertrui Van de Voorde:
The geometric field of linearity of linear sets. Des. Codes Cryptogr. 90(3): 779-799 (2022) - [j27]Jeroen Schillewaert, Geertrui Van de Voorde:
Characterising elliptic and hyperbolic hyperplanes of the parabolic quadric Q(2n, q). Finite Fields Their Appl. 78: 101961 (2022) - [j26]Maarten De Boeck, Geertrui Van de Voorde:
The weight distributions of linear sets in PG(1, q5). Finite Fields Their Appl. 82: 102034 (2022) - 2021
- [j25]Dibyayoti Jena, Geertrui Van de Voorde:
On linear sets of minimum size. Discret. Math. 344(3): 112230 (2021) - 2020
- [j24]Jozefien D'haeseleer, Geertrui Van de Voorde:
Translation Hyperovals and $\mathbb{F}_2$-Linear Sets of Pseudoregulus Type. Electron. J. Comb. 27(3): 3 (2020) - [j23]John Sheekey, Geertrui Van de Voorde:
Rank-metric codes, linear sets, and their duality. Des. Codes Cryptogr. 88(4): 655-675 (2020) - 2019
- [j22]Maarten De Boeck, Geertrui Van de Voorde:
Elation KM-Arcs. Comb. 39(3): 501-544 (2019) - [j21]Jan De Beule, Geertrui Van de Voorde:
The minimum size of a linear set. J. Comb. Theory, Ser. A 164: 109-124 (2019) - 2018
- [j20]Maarten De Boeck, Geertrui Van de Voorde:
A New Lower Bound for the Size of an Affine Blocking Set. Electron. J. Comb. 25(4): 4 (2018) - 2017
- [j19]Jozefien D'haeseleer, Klaus Metsch, Leo Storme, Geertrui Van de Voorde:
On the maximality of a set of mutually orthogonal Sudoku Latin Squares. Des. Codes Cryptogr. 84(1-2): 143-152 (2017) - 2016
- [j18]Jan De Beule, Tamás Héger, Tamás Szonyi, Geertrui Van de Voorde:
Blocking and Double Blocking Sets in Finite Planes. Electron. J. Comb. 23(2): 2 (2016) - 2015
- [j17]Sara Rottey, Geertrui Van de Voorde:
Characterisations of Elementary Pseudo-Caps and Good Eggs. Electron. J. Comb. 22(1): 1 (2015) - [j16]Stefaan De Winter, Sara Rottey, Geertrui Van de Voorde:
Linear representations of subgeometries. Des. Codes Cryptogr. 77(1): 203-215 (2015) - [j15]Sara Rottey, John Sheekey, Geertrui Van de Voorde:
Subgeometries in the André/Bruck-Bose representation. Finite Fields Their Appl. 35: 115-138 (2015) - [j14]Sara Rottey, Geertrui Van de Voorde:
Pseudo-ovals in even characteristic and ovoidal Laguerre planes. J. Comb. Theory, Ser. A 129: 105-121 (2015) - 2013
- [j13]Michel Lavrauw, Geertrui Van de Voorde:
Scattered Linear Sets and Pseudoreguli. Electron. J. Comb. 20(1): 15 (2013) - [j12]Péter Sziklai, Geertrui Van de Voorde:
A small minimal blocking set in PG(n, pt), spanning a (t-1)-space, is linear. Des. Codes Cryptogr. 68(1-3): 25-32 (2013) - [j11]Tim Penttila, Geertrui Van de Voorde:
Extending pseudo-arcs in odd characteristic. Finite Fields Their Appl. 22: 101-113 (2013) - 2011
- [j10]Geertrui Van de Voorde:
On sets without tangents and exterior sets of a conic. Discret. Math. 311(20): 2253-2258 (2011) - [j9]Michel Lavrauw, Leo Storme, Geertrui Van de Voorde:
A proof of the linearity conjecture for k-blocking sets in PG(n, p3), p prime. J. Comb. Theory, Ser. A 118(3): 808-818 (2011) - 2010
- [j8]Geertrui Van de Voorde:
On the Linearity of Higher-Dimensional Blocking Sets. Electron. J. Comb. 17(1) (2010) - [j7]Michel Lavrauw, Geertrui Van de Voorde:
On linear sets on a projective line. Des. Codes Cryptogr. 56(2-3): 89-104 (2010) - [j6]Valentina Pepe, Leo Storme, Geertrui Van de Voorde:
On codewords in the dual code of classical generalised quadrangles and classical polar spaces. Discret. Math. 310(22): 3132-3148 (2010) - [j5]Stefan M. Dodunekov, Leo Storme, Geertrui Van de Voorde:
Partial covers of PG(n, q). Eur. J. Comb. 31(6): 1611-1616 (2010) - 2009
- [j4]Michel Lavrauw, Leo Storme, Péter Sziklai, Geertrui Van de Voorde:
An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n, q). J. Comb. Theory, Ser. A 116(4): 996-1001 (2009) - 2008
- [j3]Veerle Fack, Szabolcs L. Fancsali, Leo Storme, Geertrui Van de Voorde, Joost Winne:
Small weight codewords in the codes arising from Desarguesian projective planes. Des. Codes Cryptogr. 46(1): 25-43 (2008) - [j2]Michel Lavrauw, Leo Storme, Geertrui Van de Voorde:
On the code generated by the incidence matrix of points and hyperplanes in PG(n, q) and its dual. Des. Codes Cryptogr. 48(3): 231-245 (2008) - [j1]Michel Lavrauw, Leo Storme, Geertrui Van de Voorde:
On the code generated by the incidence matrix of points and k-spaces in PG(n, q) and its dual. Finite Fields Their Appl. 14(4): 1020-1038 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
