Majority coset decoding. - Iwan M. Duursma (IEEE Trans. Inf. Theory, 1993)

Algebraic decoding using special divisors. - Iwan M. Duursma (IEEE Trans. Inf. Theory, 1993)

Error-locating pairs for cyclic codes. - Iwan M. Duursma; Ralf Kötter (IEEE Trans. Inf. Theory, 1994)

Translates of linear codes over Z4. - Alexis Bonnecaze; Iwan M. Duursma (IEEE Trans. Inf. Theory, 1997)

Cyclic Subcodes of Generalized Reed-Muller Codes. - Oscar Moreno; Iwan M. Duursma; Jean-Pierre Cherdieu; Antoine Edouard (IEEE Trans. Inf. Theory, 1998)

Speeding up the Discrete Log Computation on Curves with Automorphisms. - Iwan M. Duursma; Pierrick Gaudry; François Morain (ASIACRYPT, 1999)

A Riemann hypothesis analogue for self-dual codes. - Iwan M. Duursma (Codes and Association Schemes, 1999)

Split Weight Enumerators for the Preparata Codes with Applications to Designs. - Iwan M. Duursma; Tor Helleseth; Chunming Rong; Kyeongcheol Yang (Des. Codes Cryptogr., 1999)

Monomial embeddings of the Klein curve. - Iwan M. Duursma (Discret. Math., 1999)

On the Optimal Integer 4 Codes of Type II and Length 16. - Iwan M. Duursma; Marcus Greferath; Stefan E. Schmidt (J. Comb. Theory A, 2000)

Reed-Muller Codes on Complete Intersections. - Iwan M. Duursma; Carlos Rentería-Márquez; Horacio Tapia-Recillas (Appl. Algebra Eng. Commun. Comput., 2001)

From weight enumerators to zeta functions. - Iwan M. Duursma (Discret. Appl. Math., 2001)

Preparata codes through lattices. - Iwan M. Duursma (IEEE Trans. Inf. Theory, 2001)

A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code. - Iwan M. Duursma; Marcus Greferath; Simon Litsyn; Stefan E. Schmidt (IEEE Trans. Inf. Theory, 2001)

Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d. - Iwan M. Duursma; Hyang-Sook Lee (ASIACRYPT, 2003)

Combinatorics of the Two-Variable Zeta Function. - Iwan M. Duursma (International Conference on Finite Fields and Applications, 2003)

Everywhere Ramified Towers of Global Function Fields. - Iwan M. Duursma; Bjorn Poonen; Michael E. Zieve (International Conference on Finite Fields and Applications, 2003)

Extremal weight enumerators and ultraspherical polynomials. - Iwan M. Duursma (Discret. Math., 2003)

Tate-pairing implementations for tripartite key agreement. - Iwan M. Duursma; Hyang-Sook Lee (IACR Cryptol. ePrint Arch., 2003)

Geometric Reed-Solomon codes of length 64 and 65 over F8. - Chien-Yu Chen 001; Iwan M. Duursma (IEEE Trans. Inf. Theory, 2003)

On the vector decomposition problem for m-torsion points on an elliptic curve. - Negar Kiyavash; Iwan M. Duursma (ISIT, 2004)

A group key agreement protocol from pairings. - Iwan M. Duursma; Hyang-Sook Lee (Appl. Math. Comput., 2005)

The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves. - Iwan M. Duursma; Negar Kiyavash (IACR Cryptol. ePrint Arch., 2005)

ElGamal type signature schemes for n-dimensional vector spaces. - Iwan M. Duursma; Seungkook Park (IACR Cryptol. ePrint Arch., 2006)

A symmetric Roos bound for linear codes. - Iwan M. Duursma; Ruud Pellikaan (J. Comb. Theory A, 2006)

An Extension of the Order Bound for AG Codes. - Iwan M. Duursma; Radoslav Kirov (AAECC, 2009)

Distance bounds for algebraic geometric codes - Iwan M. Duursma; Radoslav Kirov; Seungkook Park (CoRR, 2010)

Coset bounds for algebraic geometric codes. - Iwan M. Duursma; Seungkook Park (Finite Fields Their Appl., 2010)

Binomial moments for divisible self-dual codes. - Iwan M. Duursma (Int. J. Inf. Coding Theory, 2010)

Two-Point Coordinate Rings for GK-Curves. - Iwan M. Duursma (IEEE Trans. Inf. Theory, 2011)

Improved Two-Point Codes on Hermitian Curves. - Iwan M. Duursma; Radoslav Kirov (IEEE Trans. Inf. Theory, 2011)

Multiplicative secret sharing schemes from Reed-Muller type codes. - Iwan M. Duursma; Jiashun Shen (ISIT, 2012)

Delta sets for divisors supported in two points. - Iwan M. Duursma; Seungkook Park (Finite Fields Their Appl., 2012)

Using concatenated algebraic geometry codes in channel polarization. - Abdulla Eid; Iwan M. Duursma (CoRR, 2013)

Evaluation codes from smooth quadric surfaces and twisted Segre varieties. - Alain Couvreur; Iwan M. Duursma (Des. Codes Cryptogr., 2013)

Distributed reed-solomon codes for simple multiple access networks. - Wael Halbawi; Tracey Ho; Hongyi Yao; Iwan M. Duursma (ISIT, 2014)

Distributed gabidulin codes for multiple-source network error correction. - Wael Halbawi; Tracey Ho; Iwan M. Duursma (NetCod, 2014)

Outer bounds for exact repair codes. - Iwan M. Duursma (CoRR, 2014)

Rank-metric codes with local recoverability. - Swanand Kadhe; Salim Y. El Rouayheb; Iwan M. Duursma; Alex Sprintson (Allerton, 2016)

Repairing reed-solomon codes with two erasures. - Hoang Dau; Iwan M. Duursma; Han Mao Kiah; Olgica Milenkovic (ISIT, 2017)

Balanced and sparse Tamo-Barg codes. - Wael Halbawi; Iwan M. Duursma; Hoang Dau; Babak Hassibi (ISIT, 2017)

Sector-disk codes with three global parities. - Xiao Li; Iwan M. Duursma (ISIT, 2017)

Low bandwidth repair of the RS(10, 4) Reed-Solomon code. - Iwan M. Duursma; Hoang Dau (ITA, 2017)

On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes. - Hoang Dau; Iwan M. Duursma; Hien Chu (ISIT, 2018)

Polar Code Moderate Deviation: Recovering the Scaling Exponent. - Hsin-Po Wang 001; Iwan M. Duursma (CoRR, 2018)

Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels. - Hsin-Po Wang 001; Iwan M. Duursma (CoRR, 2018)

Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability. - Hsin-Po Wang 001; Iwan M. Duursma (CoRR, 2018)

Rank metric codes and zeta functions. - Iván Blanco-Chacón; Eimear Byrne; Iwan M. Duursma; John Sheekey (Des. Codes Cryptogr., 2018)

Repairing Reed-Solomon Codes With Multiple Erasures. - Hoang Dau; Iwan M. Duursma; Han Mao Kiah; Olgica Milenkovic (IEEE Trans. Inf. Theory, 2018)

Matrix theory for minimal trellises. - Iwan M. Duursma (Des. Codes Cryptogr., 2019)

Shortened Regenerating Codes. - Iwan M. Duursma (IEEE Trans. Inf. Theory, 2019)

Sparse and Balanced Reed-Solomon and Tamo-Barg Codes. - Wael Halbawi; Zihan Liu; Iwan M. Duursma; Hoang Dau; Babak Hassibi (IEEE Trans. Inf. Theory, 2019)

Codes With Locality in the Rank and Subspace Metrics. - Swanand Kadhe; Salim Y. El Rouayheb; Iwan M. Duursma; Alex Sprintson (IEEE Trans. Inf. Theory, 2019)

Multilinear Algebra for Minimum Storage Regenerating Codes. - Iwan M. Duursma; Hsin-Po Wang 001 (CoRR, 2020)

Parity-Checked Strassen Algorithm. - Hsin-Po Wang 001; Iwan M. Duursma (CoRR, 2020)

Isometry-dual flags of AG codes. - Maria Bras-Amorós; Iwan M. Duursma; Euijin Hong (Des. Codes Cryptogr., 2020)

Multilinear Algebra for Distributed Storage. - Iwan M. Duursma; Xiao Li; Hsin-Po Wang 001 (SIAM J. Appl. Algebra Geom., 2021)

Polar Codes' Simplicity, Random Codes' Durability. - Hsin-Po Wang 001; Iwan M. Duursma (IEEE Trans. Inf. Theory, 2021)

Log-Logarithmic Time Pruned Polar Coding. - Hsin-Po Wang 001; Iwan M. Duursma (IEEE Trans. Inf. Theory, 2021)

Accelerating Polarization via Alphabet Extension. - Iwan M. Duursma; Ryan Gabrys; Venkatesan Guruswami; Ting-Chun Lin; Hsin-Po Wang 001 (APPROX/RANDOM, 2022)

Johnson graph codes. - Iwan M. Duursma; Xiao Li (Des. Codes Cryptogr., 2022)

Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction. - Iwan M. Duursma; Hsin-Po Wang 001 (Appl. Algebra Eng. Commun. Comput., 2023)