Jan De Beule

480 total citations
41 papers, 300 citations indexed

About

Jan De Beule is a scholar working on Artificial Intelligence, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Jan De Beule has authored 41 papers receiving a total of 300 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Artificial Intelligence, 31 papers in Discrete Mathematics and Combinatorics and 21 papers in Electrical and Electronic Engineering. Recurrent topics in Jan De Beule's work include Coding theory and cryptography (29 papers), Finite Group Theory Research (28 papers) and graph theory and CDMA systems (21 papers). Jan De Beule is often cited by papers focused on Coding theory and cryptography (29 papers), Finite Group Theory Research (28 papers) and graph theory and CDMA systems (21 papers). Jan De Beule collaborates with scholars based in Belgium, Germany and Hungary. Jan De Beule's co-authors include Leo Storme, Klaus Metsch, Simeon Ball, A. Klein, Geertrui Van de Voorde, Alexis De Vos, Andreas Klein, Kris Coolsaet, Robert Stewart and Phil Trinder and has published in prestigious journals such as IEEE Transactions on Information Theory, Discrete Mathematics and Journal of Combinatorial Theory Series A.

In The Last Decade

Jan De Beule

38 papers receiving 264 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jan De Beule Belgium	9	246	214	154	42	41	41	300
Rex W. Matthews Australia	8	282 1.1×	110 0.5×	193 1.3×	21 0.5×	48 1.2×	16	308
Giorgio Faina Italy	11	260 1.1×	243 1.1×	195 1.3×	27 0.6×	33 0.8×	49	322
Rocco Trombetti Italy	14	367 1.5×	299 1.4×	237 1.5×	64 1.5×	63 1.5×	39	398
Klaus Metsch Germany	12	342 1.4×	419 2.0×	293 1.9×	41 1.0×	93 2.3×	87	509
Warwick de Launey United States	11	197 0.8×	145 0.7×	287 1.9×	18 0.4×	63 1.5×	39	326
Madhu Raka India	10	223 0.9×	81 0.4×	122 0.8×	57 1.4×	29 0.7×	39	284
Bernhard Schmidt Singapore	9	171 0.7×	94 0.4×	211 1.4×	24 0.6×	31 0.8×	36	243
A. S. Kuzmin Russia	8	182 0.7×	74 0.3×	101 0.7×	19 0.5×	40 1.0×	20	225
Siu Lun Singapore	11	242 1.0×	189 0.9×	271 1.8×	15 0.4×	56 1.4×	31	319
Michael E. Zieve United States	11	278 1.1×	113 0.5×	174 1.1×	20 0.5×	103 2.5×	36	349

Countries citing papers authored by Jan De Beule

Since Specialization

Citations

This map shows the geographic impact of Jan De Beule's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jan De Beule with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan De Beule more than expected).

Fields of papers citing papers by Jan De Beule

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jan De Beule. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jan De Beule. The network helps show where Jan De Beule may publish in the future.

Co-authorship network of co-authors of Jan De Beule

This figure shows the co-authorship network connecting the top 25 collaborators of Jan De Beule. A scholar is included among the top collaborators of Jan De Beule based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jan De Beule. Jan De Beule is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Beule, Jan De, et al.. (2024). On two non-existence results for Cameron–Liebler k-sets in $${{\,\mathrm{\textrm{PG}}\,}}(n,q)$$. Designs Codes and Cryptography. 93(4). 1163–1177.

Beule, Jan De, et al.. (2023). Degree 2 Boolean Functions on Grassmann Graphs. The Electronic Journal of Combinatorics. 30(1). 2 indexed citations

Beule, Jan De & Klaus Metsch. (2017). On the Smallest Non-Trivial Tight Sets in Hermitian Polar Spaces. The Electronic Journal of Combinatorics. 24(1). 5 indexed citations

Beule, Jan De, et al.. (2016). Blocking and Double Blocking Sets in Finite Planes. The Electronic Journal of Combinatorics. 23(2). 3 indexed citations

Beule, Jan De, et al.. (2013). On the structure of the directions not determined by a large affine point set. Journal of Algebraic Combinatorics. 38(4). 889–899. 1 indexed citations

Vos, Alexis De, Jan De Beule, & Leo Storme. (2010). Computing with the Square Root of NOT. 3(4). 359–370. 7 indexed citations

Vos, Alexis De, et al.. (2010). Almost-classical quantum computers. Ghent University Academic Bibliography (Ghent University). 51–56. 1 indexed citations

Beule, Jan De, Andreas Klein, Klaus Metsch, & Leo Storme. (2008). Partial ovoids and partial spreads in finite classical polar spaces. Ghent University Academic Bibliography (Ghent University). 7 indexed citations

Beule, Jan De, Klaus Metsch, & Leo Storme. (2008). Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound. Designs Codes and Cryptography. 49(1-3). 187–197. 1 indexed citations

10.

Beule, Jan De, et al.. (2007). Complete arcs on the parabolic quadricQ(4,q). Finite Fields and Their Applications. 14(1). 14–21. 8 indexed citations

11.

Beule, Jan De, A. Klein, Klaus Metsch, & Leo Storme. (2007). Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. European Journal of Combinatorics. 29(5). 1280–1297. 8 indexed citations

12.

Beule, Jan De, Klaus Metsch, & Leo Storme. (2007). Characterization results on small blocking sets of the polar spaces Q +(2n + 1, 2) and Q +(2n + 1, 3). Designs Codes and Cryptography. 44(1-3). 197–207. 1 indexed citations

13.

Beule, Jan De & Klaus Metsch. (2006). The maximum size of a partial spread in H(5,q2) is q3+1. Journal of Combinatorial Theory Series A. 114(4). 761–768. 11 indexed citations

14.

Beule, Jan De & Klaus Metsch. (2005). The smallest point sets that meet all generators of H(2n,q2). Discrete Mathematics. 294(1-2). 75–81. 4 indexed citations

15.

Beule, Jan De & Leo Storme. (2005). On the smallest minimal blocking sets of Q(2n,q), for q an odd prime. Discrete Mathematics. 294(1-2). 83–107. 7 indexed citations

16.

Beule, Jan De & Klaus Metsch. (2004). Small point sets that meet all generators of Q(2n,p), p>3 prime. Journal of Combinatorial Theory Series A. 106(2). 327–333. 8 indexed citations

17.

Beule, Jan De & Klaus Metsch. (2004). Minimal blocking sets of size q2+2 of Q(4,q), q an odd prime, do not exist. Finite Fields and Their Applications. 11(2). 305–315. 4 indexed citations

18.

Beule, Jan De, et al.. (2003). Maximal partial spreads of T2(O) and T3(O). European Journal of Combinatorics. 24(1). 73–84. 13 indexed citations

19.

Beule, Jan De & Leo Storme. (2003). The smallest minimal blocking sets of Q(6, q), q even. Journal of Combinatorial Designs. 11(4). 290–303. 8 indexed citations

20.

Beule, Jan De. (2002). The smallest minimal blocking sets of Q(2n+2,q), for small odd q. Ghent University Academic Bibliography (Ghent University). 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact