| 2009 | 
|---|
| 21 | EE | Iwan M. Duursma,
Radoslav Kirov:
An extension of the order bound for AG codes
CoRR abs/0901.2864:  (2009) | 
| 2006 | 
|---|
| 20 | EE | Iwan M. Duursma,
Ruud Pellikaan:
A symmetric Roos bound for linear codes.
J. Comb. Theory, Ser. A 113(8): 1677-1688 (2006) | 
| 2005 | 
|---|
| 19 | EE | Iwan M. Duursma,
Hyang-Sook Lee:
A group key agreement protocol from pairings.
Applied Mathematics and Computation 167(2): 1451-1456 (2005) | 
| 2003 | 
|---|
| 18 | EE | Iwan M. Duursma,
Hyang-Sook Lee:
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d.
ASIACRYPT 2003: 111-123 | 
| 17 | EE | Iwan M. Duursma:
Combinatorics of the Two-Variable Zeta Function.
International Conference on Finite Fields and Applications 2003: 109-136 | 
| 16 | EE | Iwan M. Duursma,
Bjorn Poonen,
Michael Zieve:
Everywhere Ramified Towers of Global Function Fields.
International Conference on Finite Fields and Applications 2003: 148-153 | 
| 15 | EE | Iwan M. Duursma:
Extremal weight enumerators and ultraspherical polynomials.
Discrete Mathematics 268(1-3): 103-127 (2003) | 
| 14 |  | Chien-Yu Chen,
Iwan M. Duursma:
Geometric Reed-Solomon codes of length 64 and 65 over F8.
IEEE Transactions on Information Theory 49(5): 1351-1353 (2003) | 
| 2001 | 
|---|
| 13 | EE | Iwan M. Duursma,
C. Rentería,
Horacio Tapia-Recillas:
Reed-Muller Codes on Complete Intersections.
Appl. Algebra Eng. Commun. Comput. 11(6): 455-462 (2001) | 
| 12 |  | Iwan M. Duursma:
From weight enumerators to zeta functions.
Discrete Applied Mathematics 111(1-2): 55-73 (2001) | 
| 11 |  | Iwan M. Duursma:
Preparata codes through lattices.
IEEE Transactions on Information Theory 47(1): 36-44 (2001) | 
| 10 |  | Iwan M. Duursma,
Marcus Greferath,
Simon Litsyn,
Stefan E. Schmidt:
A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code.
IEEE Transactions on Information Theory 47(4): 1596-1598 (2001) | 
| 2000 | 
|---|
| 9 | EE | Iwan M. Duursma,
Marcus Greferath,
Stefan E. Schmidt:
On the Optimal Integer 4 Codes of Type II and Length 16.
J. Comb. Theory, Ser. A 92(1): 77-82 (2000) | 
| 1999 | 
|---|
| 8 |  | Iwan M. Duursma,
Pierrick Gaudry,
François Morain:
Speeding up the Discrete Log Computation on Curves with Automorphisms.
ASIACRYPT 1999: 103-121 | 
| 7 |  | Iwan M. Duursma,
Tor Helleseth,
Chunming Rong,
Kyeongcheol Yang:
Split Weight Enumerators for the Preparata Codes with Applications to Designs.
Des. Codes Cryptography 18(1/3): 103-124 (1999) | 
| 6 | EE | Iwan M. Duursma:
Monomial embeddings of the Klein curve.
Discrete Mathematics 208-209: 235-246 (1999) | 
| 1998 | 
|---|
| 5 |  | Oscar Moreno,
Iwan M. Duursma,
Jean-Pierre Cherdieu,
A. Edouard:
Cyclic Subcodes of Generalized Reed-Muller Codes.
IEEE Transactions on Information Theory 44(1): 307-311 (1998) | 
| 1997 | 
|---|
| 4 |  | Alexis Bonnecaze,
Iwan M. Duursma:
Translates of linear codes over Z4.
IEEE Transactions on Information Theory 43(4): 1218-1230 (1997) | 
| 1994 | 
|---|
| 3 |  | Iwan M. Duursma,
Ralf Kötter:
Error-locating pairs for cyclic codes.
IEEE Transactions on Information Theory 40(4): 1108-1121 (1994) | 
| 1993 | 
|---|
| 2 |  | Iwan M. Duursma:
Algebraic decoding using special divisors.
IEEE Transactions on Information Theory 39(2): 694- (1993) | 
| 1 |  | Iwan M. Duursma:
Majority coset decoding.
IEEE Transactions on Information Theory 39(3): 1067- (1993) |