Iwan Duursma
Titel
Citeras av
Citeras av
År
Tate Pairing Implementation for Hyperelliptic Curves y2 = xpx + d
I Duursma, HS Lee
International Conference on the Theory and Application of Cryptology and …, 2003
3302003
Speeding up the discrete log computation on curves with automorphisms
I Duursma, P Gaudry, F Morain
International Conference on the Theory and Application of Cryptology and …, 1999
1161999
Reed-Muller codes on complete intersections
IM Duursma, C Rentería, H Tapia-Recillas
Applicable Algebra in Engineering, Communication and Computing 11 (6), 455-462, 2001
872001
Majority coset decoding
IM Duursma
IEEE transactions on information theory 39 (3), 1067-1070, 1993
691993
Weight distributions of geometric Goppa codes
I Duursma
Transactions of the American Mathematical Society 351 (9), 3609-3639, 1999
631999
Error-locating pairs for cyclic codes
IM Duursma, R Kotter
IEEE Transactions on Information Theory 40 (4), 1108-1121, 1994
551994
From weight enumerators to zeta functions
I Duursma
Discrete Applied Mathematics 111 (1-2), 55-73, 2001
512001
Coset bounds for algebraic geometric codes
IM Duursma, S Park
Finite Fields and Their Applications 16 (1), 36-55, 2010
452010
Extremal weight enumerators and ultraspherical polynomials
I Duursma
Discrete Mathematics 268 (1-3), 103-127, 2003
422003
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
372018
Decoding--Codes from Curves and Cyclic Codes
IM Duursma
361993
Distance bounds for algebraic geometric codes
I Duursma, R Kirov, S Park
Journal of Pure and Applied Algebra 215 (8), 1863-1878, 2011
342011
Algebraic decoding using special divisors
IM Duursma
IEEE transactions on information theory 39 (2), 694-698, 1993
331993
A Riemann hypothesis analogue for self-dual codes
I Duursma
Codes and association schemes (Piscataway, NJ, 1999), 115-124, 2001
312001
Outer bounds for exact repair codes
IM Duursma
arXiv preprint arXiv:1406.4852, 2014
302014
The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves.
IM Duursma, N Kiyavash
IACR Cryptol. ePrint Arch. 2005, 31, 2005
302005
Translates of linear codes over Z/sub 4
A Bonnecaze, IM Duursma
IEEE Transactions on information theory 43 (4), 1218-1230, 1997
291997
Tate-pairing implementations for tripartite key agreement
I Duursma, HS Lee
272003
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
252014
Shortened regenerating codes
IM Duursma
IEEE Transactions on Information Theory 65 (2), 1000-1007, 2018
222018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20