default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeroen Schillewaert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Anneleen De Schepper, Jeroen Schillewaert, Hendrik Van Maldeghem:
On the Generating Rank and Embedding Rank of the Hexagonic Lie Incidence Geometries. Comb. 44(2): 355-392 (2024)- 2022
- [j18]Jeroen Schillewaert, Geertrui Van de Voorde:
Quasi-polar spaces. Comb. Theory 2(3) (2022) - [j17]Arjeh M. Cohen, Anneleen De Schepper, Jeroen Schillewaert, Hendrik Van Maldeghem:
Shult's Haircut Theorem revised. Eur. J. Comb. 102: 103503 (2022) - [j16]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) - 2021
- [j15]Susan G. Barwick, Alice M. W. Hui, Wen-Ai Jackson, Jeroen Schillewaert:
Characterising the secant lines of Q(4, q), q even. J. Comb. Theory A 182: 105476 (2021) - 2020
- [j14]Susan G. Barwick, Alice M. W. Hui, Wen-Ai Jackson, Jeroen Schillewaert:
Characterising hyperbolic hyperplanes of a non-singular quadric in PG(4, q). Des. Codes Cryptogr. 88(1): 33-39 (2020) - [j13]Heiko Dietrich, Jeroen Schillewaert:
On a duality for codes over non-abelian groups. Des. Codes Cryptogr. 88(5): 789-805 (2020) - [j12]Stefaan De Winter, Jeroen Schillewaert:
Recognizing sets of generators in finite polar spaces. J. Comb. Theory A 173: 105211 (2020)
2010 – 2019
- 2018
- [j11]Anurag Bishnoi, Sam Mattheus, Jeroen Schillewaert:
Minimal Multiple Blocking Sets. Electron. J. Comb. 25(4): 4 (2018) - 2015
- [j10]Jeroen Schillewaert, Jacques Verstraëte:
Probabilistic constructions in generalized quadrangles. Discret. Math. 338(6): 1000-1010 (2015) - 2014
- [j9]Jeroen Schillewaert, Hendrik Van Maldeghem:
Imbrex geometries. J. Comb. Theory A 127: 286-302 (2014) - [j8]Jeroen Schillewaert, Koen Thas:
Construction and Comparison of Authentication Codes. SIAM J. Discret. Math. 28(1): 474-489 (2014) - 2012
- [j7]Stefaan De Winter, Jeroen Schillewaert, Jacques Verstraëte:
Large Incidence-free Sets in Geometries. Electron. J. Comb. 19(4): 24 (2012) - 2010
- [j6]Stefaan De Winter, Jeroen Schillewaert:
Characterizations of finite classical polar spaces by intersection numbers with hyperplanes and spaces of codimension 2. Comb. 30(1): 25-45 (2010) - [j5]Jeroen Schillewaert, Leo Storme, Joseph A. Thas:
Minimal codewords in Reed-Muller codes. Des. Codes Cryptogr. 54(3): 273-286 (2010) - [j4]Jan De Beule, Yves Edel, Emilia Käsper, Andreas Klein, Svetla Nikova, Bart Preneel, Jeroen Schillewaert, Leo Storme:
Galois geometries and applications. Des. Codes Cryptogr. 56(2-3): 85-86 (2010)
2000 – 2009
- 2009
- [j3]Jeroen Schillewaert, Joseph A. Thas:
Characterizations of Hermitian varieties by intersection numbers. Des. Codes Cryptogr. 50(1): 41-60 (2009) - [j2]Andreas Klein, Jeroen Schillewaert, Leo Storme:
Generalised dual arcs and Veronesean surfaces, with applications to cryptography. J. Comb. Theory A 116(3): 684-698 (2009) - 2008
- [j1]Jeroen Schillewaert:
A characterization of quadrics by intersection numbers. Des. Codes Cryptogr. 47(1-3): 165-175 (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 2025-01-09 12:53 CET 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:
