H. van Tilborg

2.0k total citations · 1 hit paper
26 papers, 1.0k citations indexed

About

H. van Tilborg is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, H. van Tilborg has authored 26 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Artificial Intelligence, 15 papers in Electrical and Electronic Engineering and 10 papers in Computer Networks and Communications. Recurrent topics in H. van Tilborg's work include Coding theory and cryptography (17 papers), graph theory and CDMA systems (12 papers) and Error Correcting Code Techniques (7 papers). H. van Tilborg is often cited by papers focused on Coding theory and cryptography (17 papers), graph theory and CDMA systems (12 papers) and Error Correcting Code Techniques (7 papers). H. van Tilborg collaborates with scholars based in Netherlands, United States and Norway. H. van Tilborg's co-authors include Robert J. McEliece, Elwyn R. Berlekamp, Mario Blaum, Tor Helleseth, Andrew Odlyzko, P.G. Farrell, Khaled Abdel-Ghaffar, Huaxiong Wang, L. D. Baumert and T Tom Verhoeff and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Computers and Discrete Mathematics.

In The Last Decade

H. van Tilborg

25 papers receiving 923 citations

Hit Papers

On the inherent intractability of certain coding problems... 1978 2026 1994 2010 1978 200 400 600

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
H. van Tilborg Netherlands 11 814 522 427 220 116 26 1.0k
Henk C. A. van Tilborg Netherlands 15 487 0.6× 363 0.7× 300 0.7× 122 0.6× 41 0.4× 33 864
Philippe Gaborit France 20 1.1k 1.3× 628 1.2× 229 0.5× 257 1.2× 160 1.4× 77 1.2k
Gérard Cohen France 20 893 1.1× 739 1.4× 541 1.3× 433 2.0× 180 1.6× 90 1.3k
M.U. Siddiqi Malaysia 11 334 0.4× 265 0.5× 178 0.4× 92 0.4× 44 0.4× 44 469
Ludo Tolhuizen Netherlands 14 335 0.4× 870 1.7× 1.0k 2.4× 98 0.4× 85 0.7× 43 1.4k
J. Justesen Denmark 17 671 0.8× 436 0.8× 341 0.8× 348 1.6× 79 0.7× 46 874
Rolf Johannesson Sweden 16 596 0.7× 952 1.8× 910 2.1× 224 1.0× 51 0.4× 105 1.2k
S.E. Tavares Canada 14 575 0.7× 201 0.4× 88 0.2× 135 0.6× 48 0.4× 53 707
Shu Lin United States 17 837 1.0× 1.5k 2.9× 1.6k 3.8× 230 1.0× 102 0.9× 37 1.9k
Harold Fredricksen United States 11 428 0.5× 222 0.4× 57 0.1× 346 1.6× 61 0.5× 17 611

Countries citing papers authored by H. van Tilborg

Since Specialization
Citations

This map shows the geographic impact of H. van Tilborg'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 H. van Tilborg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites H. van Tilborg more than expected).

Fields of papers citing papers by H. van Tilborg

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by H. van Tilborg. 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 H. van Tilborg. The network helps show where H. van Tilborg may publish in the future.

Co-authorship network of co-authors of H. van Tilborg

This figure shows the co-authorship network connecting the top 25 collaborators of H. van Tilborg. A scholar is included among the top collaborators of H. van Tilborg 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 H. van Tilborg. H. van Tilborg is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Tilborg, H. van, Josef Pieprzyk, Ron Steinfeld, & Huaxiong Wang. (2007). New constructions of anonymous membership broadcasting schemes. Data Archiving and Networked Services (DANS). 3 indexed citations
2.
Blokhuis, Aart, et al.. (2006). Jack van Lint (1932–2004): A survey of his scientific work. Journal of Combinatorial Theory Series A. 113(8). 1594–1613. 1 indexed citations
3.
Xu, Shengbo, Jeroen Doumen, & H. van Tilborg. (2003). On the Security of Digital Signature Schemes Based on Error-Correcting Codes. Designs Codes and Cryptography. 28(2). 187–199. 2 indexed citations
4.
Dijk, Marten van & H. van Tilborg. (2002). The art of distilling [secret key generation]. 158–159. 2 indexed citations
5.
Tilborg, H. van, et al.. (2002). On quasi-cyclic codes. 65–65. 5 indexed citations
6.
Xu, Shengbo & H. van Tilborg. (2002). A new identity-based conference key distribution scheme. 269–269. 2 indexed citations
7.
Dijk, Marten van, et al.. (1998). The Art of Distilling. 1 indexed citations
8.
Tilborg, H. van & Mario Blaum. (1989). On error-correcting balanced codes. IEEE Transactions on Information Theory. 35(5). 1091–1095. 32 indexed citations
9.
Blaum, Mario & H. van Tilborg. (1989). On t-error correcting/all unidirectional error detecting codes. IEEE Transactions on Computers. 38(11). 1493–1501. 52 indexed citations
10.
Tilborg, H. van. (1986). An upper bound for codes for the noisy two-access binary adder channel (Corresp.). IEEE Transactions on Information Theory. 32(3). 436–440. 2 indexed citations
11.
Abdel-Ghaffar, Khaled, Robert J. McEliece, Andrew Odlyzko, & H. van Tilborg. (1986). On the existence of optimum cyclic burst- correcting codes. IEEE Transactions on Information Theory. 32(6). 768–775. 29 indexed citations
12.
Blaum, Mario, H. van Tilborg, & P.G. Farrell. (1986). A class of burst error-correcting array codes (Corresp.). IEEE Transactions on Information Theory. 32(6). 836–839. 21 indexed citations
13.
Tilborg, H. van, et al.. (1985). On the covering radius of binary, linear codes meeting the Griesmer bound. IEEE Transactions on Information Theory. 31(4). 465–468. 6 indexed citations
14.
Tilborg, H. van, et al.. (1985). A family of good uniquely decodable code pairs for the two-access binary adder channel. IEEE Transactions on Information Theory. 31(1). 3–9. 19 indexed citations
15.
Helleseth, Tor & H. van Tilborg. (1981). A new class of codes meeting the Griesmer bound. IEEE Transactions on Information Theory. 27(5). 548–555. 15 indexed citations
16.
Tilborg, H. van. (1980). On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound. Information and Control. 44(1). 16–35. 44 indexed citations
17.
Baumert, L. D., Robert J. McEliece, & H. van Tilborg. (1979). Symbol synchronization in convolutionally coded systems (Corresp.). IEEE Transactions on Information Theory. 25(3). 362–365. 10 indexed citations
18.
Tilborg, H. van. (1978). An upper bound for codes in a two-access binary erasure channel (Corresp.). IEEE Transactions on Information Theory. 24(1). 112–116. 21 indexed citations
19.
Tilborg, H. van. (1978). On quasi-cyclic codes with rate l m (Corresp.). IEEE Transactions on Information Theory. 24(5). 628–630. 38 indexed citations
20.
Berlekamp, Elwyn R., Robert J. McEliece, & H. van Tilborg. (1978). On the inherent intractability of certain coding problems (Corresp.). IEEE Transactions on Information Theory. 24(3). 384–386. 673 indexed citations breakdown →

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

Rankless by CCL
2026