| Tate pairing implementation for hyperelliptic curves y^ 2= x^ p-x+ d I Duursma, HS Lee Asiacrypt 2894, 111-123, 2003 | 353 | 2003 |
| Speeding up the discrete log computation on curves with automorphisms I Duursma, P Gaudry, F Morain Advances in Cryptology-ASIACRYPT’99: International Conference on the Theory …, 1999 | 130 | 1999 |
| Reed-Muller codes on complete intersections IM Duursma, C Rentería, H Tapia-Recillas Applicable Algebra in Engineering, Communication and Computing 11, 455-462, 2001 | 102 | 2001 |
| Repairing Reed-Solomon codes with multiple erasures H Dau, IM Duursma, HM Kiah, O Milenkovic IEEE Transactions on Information Theory 64 (10), 6567-6582, 2018 | 82 | 2018 |
| Majority coset decoding IM Duursma IEEE transactions on information theory 39 (3), 1067-1070, 1993 | 71 | 1993 |
| Weight distributions of geometric Goppa codes I Duursma Transactions of the American Mathematical Society 351 (9), 3609-3639, 1999 | 67 | 1999 |
| Error-locating pairs for cyclic codes IM Duursma, R Kotter IEEE Transactions on Information Theory 40 (4), 1108-1121, 1994 | 62 | 1994 |
| From weight enumerators to zeta functions I Duursma Discrete Applied Mathematics 111 (1-2), 55-73, 2001 | 55 | 2001 |
| Extremal weight enumerators and ultraspherical polynomials I Duursma Discrete mathematics 268 (1-3), 103-127, 2003 | 49 | 2003 |
| Coset bounds for algebraic geometric codes IM Duursma, S Park Finite Fields and Their Applications 16 (1), 36-55, 2010 | 46 | 2010 |
| Algebraic decoding using special divisors IM Duursma IEEE transactions on information theory 39 (2), 694-698, 1993 | 39 | 1993 |
| Decoding codes from curves and cyclic codes IM Duursma Technische Universiteit Eindhoven, 1993 | 38 | 1993 |
| Outer bounds for exact repair codes IM Duursma arXiv preprint arXiv:1406.4852, 2014 | 37 | 2014 |
| Distance bounds for algebraic geometric codes I Duursma, R Kirov, S Park Journal of Pure and Applied Algebra 215 (8), 1863-1878, 2011 | 36 | 2011 |
| Translates of linear codes over Z/sub 4 A Bonnecaze, IM Duursma IEEE Transactions on information theory 43 (4), 1218-1230, 1997 | 36 | 1997 |
| The vector decomposition problem for elliptic and hyperelliptic curves I Duursma, N Kiyavash Cryptology ePrint Archive, 2005 | 35 | 2005 |
| Distributed reed-solomon codes for simple multiple access networks W Halbawi, T Ho, H Yao, I Duursma 2014 IEEE International Symposium on Information Theory, 651-655, 2014 | 33 | 2014 |
| A Riemann hypothesis analogue for self-dual codes I Duursma Codes and Association Schemes, 115-124, 2001 | 33 | 2001 |
| Tate-pairing implementations for tripartite key agreement I Duursma, HS Lee Cryptology ePrint Archive, 2003 | 30 | 2003 |
| Shortened regenerating codes IM Duursma IEEE Transactions on Information Theory 65 (2), 1000-1007, 2018 | 29 | 2018 |
