Iwan Duursma

1.5k total citations
44 papers, 450 citations indexed

About

Iwan Duursma is a scholar working on Artificial Intelligence, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Iwan Duursma has authored 44 papers receiving a total of 450 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Artificial Intelligence, 20 papers in Computer Networks and Communications and 13 papers in Electrical and Electronic Engineering. Recurrent topics in Iwan Duursma's work include Coding theory and cryptography (29 papers), graph theory and CDMA systems (12 papers) and Finite Group Theory Research (10 papers). Iwan Duursma is often cited by papers focused on Coding theory and cryptography (29 papers), graph theory and CDMA systems (12 papers) and Finite Group Theory Research (10 papers). Iwan Duursma collaborates with scholars based in United States, France and Netherlands. Iwan Duursma's co-authors include Son Hoang Dau, Ralf Kötter, Han Mao Kiah, Olgica Milenković, Horacio Tapia-Recillas, Carlos Rentería-Márquez, Alexis Bonnecaze, Negar Kiyavash, Alain Couvreur and Ruud Pellikaan and has published in prestigious journals such as IEEE Transactions on Information Theory, Transactions of the American Mathematical Society and Applied Mathematics and Computation.

In The Last Decade

Iwan Duursma

44 papers receiving 409 citations

Peers

Iwan Duursma
Maosheng Xiong Hong Kong
Olav Geil Denmark
Rongquan Feng China
Robert S. Coulter United States
Marcel van der Vlugt Netherlands
Daniele Bartoli Italy
Michael E. O’Sullivan United States
Ana Sălăgean United Kingdom
Cem Güneri̇ Türkiye
Shudi Yang China
Maosheng Xiong Hong Kong
Iwan Duursma
Citations per year, relative to Iwan Duursma Iwan Duursma (= 1×) peers Maosheng Xiong

Countries citing papers authored by Iwan Duursma

Since Specialization
Citations

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

Fields of papers citing papers by Iwan Duursma

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Iwan Duursma

This figure shows the co-authorship network connecting the top 25 collaborators of Iwan Duursma. A scholar is included among the top collaborators of Iwan Duursma 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 Iwan Duursma. Iwan Duursma 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.
Dau, Son Hoang, Iwan Duursma, Han Mao Kiah, & Olgica Milenković. (2018). Repairing Reed-Solomon Codes With Multiple Erasures. IEEE Transactions on Information Theory. 64(10). 6567–6582. 45 indexed citations
2.
Liu, Zihan, et al.. (2018). Sparse and Balanced Reed–Solomon and Tamo–Barg Codes. IEEE Transactions on Information Theory. 65(1). 118–130. 5 indexed citations
3.
Dau, Son Hoang, Iwan Duursma, Han Mao Kiah, & Olgica Milenković. (2017). Repairing reed-solomon codes with two erasures. 351–355. 10 indexed citations
4.
Duursma, Iwan & Son Hoang Dau. (2017). Low bandwidth repair of the RS(10,4) Reed-Solomon code. 1–10. 18 indexed citations
5.
Duursma, Iwan, et al.. (2012). Delta sets for divisors supported in two points. Finite Fields and Their Applications. 18(5). 865–885. 6 indexed citations
6.
Couvreur, Alain & Iwan Duursma. (2012). Evaluation codes from smooth quadric surfaces and twisted Segre varieties. Designs Codes and Cryptography. 66(1-3). 291–303. 7 indexed citations
7.
Duursma, Iwan, et al.. (2012). On maximal curves which are not Galois subcovers of the Hermitian curve. Bulletin of the Brazilian Mathematical Society New Series. 43(3). 453–465. 13 indexed citations
8.
Duursma, Iwan, et al.. (2010). Two families of maximal curves which are not Galois subcovers of the Hermitian curve. arXiv (Cornell University). 1 indexed citations
9.
Duursma, Iwan, et al.. (2010). Coset bounds for algebraic geometric codes. Finite Fields and Their Applications. 16(1). 36–55. 25 indexed citations
10.
Duursma, Iwan & Ruud Pellikaan. (2006). A symmetric Roos bound for linear codes. Journal of Combinatorial Theory Series A. 113(8). 1677–1688. 7 indexed citations
11.
Duursma, Iwan & Negar Kiyavash. (2005). The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves.. 2005(1). 31. 11 indexed citations
12.
Chen, Chien‐Yu & Iwan Duursma. (2003). Geometric reed-solomon codes of length 64 and over 65 over F/sub 8/. IEEE Transactions on Information Theory. 49(5). 1351–1353. 7 indexed citations
13.
Duursma, Iwan. (2002). Extremal weight enumerators and ultraspherical polynomials. Discrete Mathematics. 268(1-3). 103–127. 13 indexed citations
14.
Duursma, Iwan. (2001). Preparata codes through lattices. IEEE Transactions on Information Theory. 47(1). 36–44. 2 indexed citations
15.
Duursma, Iwan. (2001). From weight enumerators to zeta functions. Discrete Applied Mathematics. 111(1-2). 55–73. 13 indexed citations
16.
Duursma, Iwan, Marcus Greferath, Simon Litsyn, & Sönke Schmidt. (2001). A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code. IEEE Transactions on Information Theory. 47(4). 1596–1598. 4 indexed citations
17.
Duursma, Iwan, Marcus Greferath, & Sönke Schmidt. (2000). On the Optimal Z4 Codes of Type II and Length 16. Journal of Combinatorial Theory Series A. 92(1). 77–82. 4 indexed citations
18.
Duursma, Iwan. (1999). Monomial embeddings of the Klein curve. Discrete Mathematics. 208-209. 235–246. 2 indexed citations
19.
Bonnecaze, Alexis & Iwan Duursma. (1997). Translates of linear codes over Z/sub 4/. IEEE Transactions on Information Theory. 43(4). 1218–1230. 14 indexed citations
20.
Duursma, Iwan. (1994). On erasure decoding of AG-codes. Data Archiving and Networked Services (DANS). 2 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

Breakdown of academic impact, for papers by Maosheng Xiong Breakdown of academic impact, for papers by Olav Geil Breakdown of academic impact, for papers by Rongquan Feng Breakdown of academic impact, for papers by Robert S. Coulter Breakdown of academic impact, for papers by Marcel van der Vlugt Breakdown of academic impact, for papers by Daniele Bartoli Breakdown of academic impact, for papers by Michael E. O’Sullivan Breakdown of academic impact, for papers by Ana Sălăgean Breakdown of academic impact, for papers by Cem Güneri̇ Breakdown of academic impact, for papers by Shudi Yang
Rankless by CCL
2026