Ludo Tolhuizen

2.4k total citations · 1 hit paper
43 papers, 1.4k citations indexed

About

Ludo Tolhuizen is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Ludo Tolhuizen has authored 43 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Artificial Intelligence, 22 papers in Electrical and Electronic Engineering and 19 papers in Computer Networks and Communications. Recurrent topics in Ludo Tolhuizen's work include Coding theory and cryptography (21 papers), graph theory and CDMA systems (14 papers) and Error Correcting Code Techniques (11 papers). Ludo Tolhuizen is often cited by papers focused on Coding theory and cryptography (21 papers), graph theory and CDMA systems (14 papers) and Error Correcting Code Techniques (11 papers). Ludo Tolhuizen collaborates with scholars based in Netherlands, Finland and Germany. Ludo Tolhuizen's co-authors include Sebastian Egner, Peter Sanders, Sidharth Jaggi, Michelle Effros, Kamal Jain, Philip A. Chou, Henk D. L. Hollmann, J. H. van Lint, Pim Tuyls and Jean‐Paul M. G. Linnartz and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Signal Processing and IEEE Transactions on Communications.

In The Last Decade

Ludo Tolhuizen

40 papers receiving 1.3k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Polynomial Time Algorithms for Multicast Network Code Construction

2005 635 citations Sidharth Jaggi, Peter Sanders et al. IEEE Transactions on Information Theory profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Ludo Tolhuizen Netherlands	14	1.0k	870	335	203	98	43	1.4k
Charles M. Fiduccia United States	12	515 0.5×	1.1k 1.2×	161 0.5×	68 0.3×	237 2.4×	19	1.4k
Y. Be'ery Israel	16	694 0.7×	825 0.9×	832 2.5×	78 0.4×	143 1.5×	58	1.2k
Henk C. A. van Tilborg Netherlands	15	300 0.3×	363 0.4×	487 1.5×	328 1.6×	122 1.2×	33	864
H. van Tilborg Netherlands	11	427 0.4×	522 0.6×	814 2.4×	108 0.5×	220 2.2×	26	1.0k
Kenneth W. Shum Hong Kong	21	1.2k 1.2×	781 0.9×	383 1.1×	49 0.2×	252 2.6×	131	1.6k
Rolf Johannesson Sweden	16	910 0.9×	952 1.1×	596 1.8×	57 0.3×	224 2.3×	105	1.2k
Yitzhak Birk Israel	15	1.1k 1.1×	740 0.9×	158 0.5×	40 0.2×	96 1.0×	73	1.3k
T.R.N. Rao United States	17	381 0.4×	765 0.9×	749 2.2×	119 0.6×	263 2.7×	65	1.3k
Jos H. Weber Netherlands	16	537 0.5×	539 0.6×	368 1.1×	58 0.3×	210 2.1×	121	920
Jean‐Claude Belfiore France	18	860 0.8×	1.1k 1.2×	303 0.9×	43 0.2×	71 0.7×	74	1.2k

Countries citing papers authored by Ludo Tolhuizen

Since Specialization

Citations

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

Fields of papers citing papers by Ludo Tolhuizen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ludo Tolhuizen

This figure shows the co-authorship network connecting the top 25 collaborators of Ludo Tolhuizen. A scholar is included among the top collaborators of Ludo Tolhuizen 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 Ludo Tolhuizen. Ludo Tolhuizen 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

Tolhuizen, Ludo, et al.. (2023). Coding and bounds for partially defective memory cells. Designs Codes and Cryptography. 91(12). 4019–4058.

Korst, Jan, et al.. (2009). Candle in the woods. TU/e Research Portal. 148–152. 4 indexed citations

Hollmann, Henk D. L. & Ludo Tolhuizen. (2006). Generic erasure correcting sets: Bounds and constructions. Journal of Combinatorial Theory Series A. 113(8). 1746–1759. 13 indexed citations

Jaggi, Sidharth, Peter Sanders, Philip A. Chou, et al.. (2005). Polynomial time algorithms for network code construction. IEEE Transactions on Information Theory. 21 indexed citations

Egner, Sebastian, et al.. (2004). On the entropy rate of a hidden markov model. 10–10. 17 indexed citations

Sanders, Peter, Sebastian Egner, & Ludo Tolhuizen. (2003). Polynomial time algorithms for network information flow. 44 indexed citations

Dijk, Marten van, et al.. (2002). Coding for informed decoders. 202–202. 9 indexed citations

Tolhuizen, Ludo. (2002). On maximum distance separable codes over alphabets of arbitrary size. 431–431. 13 indexed citations

Tolhuizen, Ludo, et al.. (2002). Union bounds on the performance of product codes. 267–267. 12 indexed citations

10.

Dijk, Marten van & Ludo Tolhuizen. (1999). Efficient encoding for a class of subspace subcodes. IEEE Transactions on Information Theory. 45(6). 2142–2146. 3 indexed citations

11.

Bierbrauer, Jürgen, Yves Edel, & Ludo Tolhuizen. (1999). New Codes via the Lengthening of BCH Codes with UEP Codes. Finite Fields and Their Applications. 5(4). 345–353. 5 indexed citations

12.

Hollmann, Henk D. L., et al.. (1998). On Codes with the Identifiable Parent Property. Journal of Combinatorial Theory Series A. 82(2). 121–133. 95 indexed citations

13.

Tolhuizen, Ludo, et al.. (1998). Comment on "Error rate performance of the projection code". IEEE Transactions on Communications. 46(5). 573–574.

14.

Hollmann, Henk D. L., et al.. (1997). Protection of software algorithms executed on secure modules. Future Generation Computer Systems. 13(1). 55–63. 1 indexed citations

15.

Tolhuizen, Ludo, Kees A. Schouhamer Immink, & Henk D. L. Hollmann. (1995). Constructions and properties of block codes for partial-response channels. IEEE Transactions on Information Theory. 41(6). 2019–2026. 2 indexed citations

16.

Tolhuizen, Ludo, Henk D. L. Hollmann, & Ton Kalker. (1995). On the realizability of biorthogonal, m-dimensional two-band filter banks. IEEE Transactions on Signal Processing. 43(3). 640–648. 20 indexed citations

17.

Brouwer, A.E. & Ludo Tolhuizen. (1993). A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters. Designs Codes and Cryptography. 3(2). 95–98. 22 indexed citations

18.

Tolhuizen, Ludo, et al.. (1992). On the weight enumerator of product codes. Discrete Mathematics. 106-107. 483–488. 9 indexed citations

19.

Tolhuizen, Ludo. (1991). Two new binary codes obtained by shortening a generalized concatenated code. IEEE Transactions on Information Theory. 37(6). 1705–1705. 2 indexed citations

20.

Tolhuizen, Ludo. (1987). New binary linear block codes (Corresp.). IEEE Transactions on Information Theory. 33(5). 727–729. 3 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