We stand with Ukraine

We stand with Ukraine

Iwan M. Duursma

Orcid: 0000-0002-2436-3944

Affiliations:

University of Illinois at Urbana-Champaign, Department of Mathematics

According to our database¹, Iwan M. Duursma authored at least 62 papers between 1993 and 2023.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org
on math.uiuc.edu

On csauthors.net:

Bibliography

2023

Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Appl. Algebra Eng. Commun. Comput., July, 2023

2022

Johnson graph codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Des. Codes Cryptogr., 2022

Accelerating Polarization via Alphabet Extension.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

,

Venkatesan Guruswami

,

,

Proceedings of the Approximation, 2022

2021

Log-Logarithmic Time Pruned Polar Coding.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

IEEE Trans. Inf. Theory, 2021

Polar Codes' Simplicity, Random Codes' Durability.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

IEEE Trans. Inf. Theory, 2021

Multilinear Algebra for Distributed Storage.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

,

SIAM J. Appl. Algebra Geom., 2021

2020

Isometry-dual flags of AG codes.

[BibT_eX]

[DOI]

Maria Bras-Amorós

,

Iwan M. Duursma

,

Des. Codes Cryptogr., 2020

Parity-Checked Strassen Algorithm.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

CoRR, 2020

Multilinear Algebra for Minimum Storage Regenerating Codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

CoRR, 2020

2019

Codes With Locality in the Rank and Subspace Metrics.

[BibT_eX]

[DOI]

,

Salim Y. El Rouayheb

,

Iwan M. Duursma

,

IEEE Trans. Inf. Theory, 2019

Sparse and Balanced Reed-Solomon and Tamo-Barg Codes.

[BibT_eX]

[DOI]

,

,

Iwan M. Duursma

,

,

IEEE Trans. Inf. Theory, 2019

Shortened Regenerating Codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

IEEE Trans. Inf. Theory, 2019

Matrix theory for minimal trellises.

[BibT_eX]

[DOI]

Iwan M. Duursma

Des. Codes Cryptogr., 2019

2018

Repairing Reed-Solomon Codes With Multiple Erasures.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

,

,

Olgica Milenkovic

IEEE Trans. Inf. Theory, 2018

Rank metric codes and zeta functions.

[BibT_eX]

[DOI]

Iván Blanco-Chacón

,

,

Iwan M. Duursma

,

Des. Codes Cryptogr., 2018

Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

CoRR, 2018

Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

CoRR, 2018

Polar Code Moderate Deviation: Recovering the Scaling Exponent.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

CoRR, 2018

On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

,

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Low bandwidth repair of the RS(10, 4) Reed-Solomon code.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Sector-disk codes with three global parities.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Balanced and sparse Tamo-Barg codes.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

,

,

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Repairing reed-solomon codes with two erasures.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

,

,

Olgica Milenkovic

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Rank-metric codes with local recoverability.

[BibT_eX]

[DOI]

,

Salim Y. El Rouayheb

,

Iwan M. Duursma

,

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2014

Outer bounds for exact repair codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

CoRR, 2014

Distributed gabidulin codes for multiple-source network error correction.

[BibT_eX]

[DOI]

,

,

Iwan M. Duursma

Proceedings of the International Symposium on Network Coding, 2014

Distributed reed-solomon codes for simple multiple access networks.

[BibT_eX]

[DOI]

,

,

,

Iwan M. Duursma

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Evaluation codes from smooth quadric surfaces and twisted Segre varieties.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

Des. Codes Cryptogr., 2013

Using concatenated algebraic geometry codes in channel polarization.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

CoRR, 2013

2012

Delta sets for divisors supported in two points.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Finite Fields Their Appl., 2012

Multiplicative secret sharing schemes from Reed-Muller type codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Improved Two-Point Codes on Hermitian Curves.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

IEEE Trans. Inf. Theory, 2011

Two-Point Coordinate Rings for GK-Curves.

[BibT_eX]

[DOI]

Iwan M. Duursma

IEEE Trans. Inf. Theory, 2011

2010

Binomial moments for divisible self-dual codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

Int. J. Inf. Coding Theory, 2010

Coset bounds for algebraic geometric codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Finite Fields Their Appl., 2010

Distance bounds for algebraic geometric codes

[BibT_eX]

[DOI]

Iwan M. Duursma

,

,

CoRR, 2010

2009

An Extension of the Order Bound for AG Codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Proceedings of the Applied Algebra, 2009

2006

A symmetric Roos bound for linear codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

J. Comb. Theory A, 2006

ElGamal type signature schemes for n-dimensional vector spaces.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

IACR Cryptol. ePrint Arch., 2006

2005

The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

IACR Cryptol. ePrint Arch., 2005

A group key agreement protocol from pairings.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Appl. Math. Comput., 2005

2004

On the vector decomposition problem for m-torsion points on an elliptic curve.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Geometric Reed-Solomon codes of length 64 and 65 over F<sub>8</sub>.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

IEEE Trans. Inf. Theory, 2003

Tate-pairing implementations for tripartite key agreement.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

IACR Cryptol. ePrint Arch., 2003

Extremal weight enumerators and ultraspherical polynomials.

[BibT_eX]

[DOI]

Iwan M. Duursma

Discret. Math., 2003

Everywhere Ramified Towers of Global Function Fields.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

,

Proceedings of the Finite Fields and Applications, 2003

Combinatorics of the Two-Variable Zeta Function.

[BibT_eX]

[DOI]

Iwan M. Duursma

Proceedings of the Finite Fields and Applications, 2003

Tate Pairing Implementation for Hyperelliptic Curves y<sup>2</sup> = x<sup>p</sup>-x + d.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

2001

A Z<sub>8</sub>-linear lift of the binary Golay code and a nonlinear Binary (96, 2<sup>37</sup>, 24)-code.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Marcus Greferath

,

,

Stefan E. Schmidt

IEEE Trans. Inf. Theory, 2001

Preparata codes through lattices.

[BibT_eX]

[DOI]

Iwan M. Duursma

IEEE Trans. Inf. Theory, 2001

From weight enumerators to zeta functions.

[BibT_eX]

[DOI]

Iwan M. Duursma

Discret. Appl. Math., 2001

Reed-Muller Codes on Complete Intersections.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Carlos Rentería-Márquez

,

Horacio Tapia-Recillas

Appl. Algebra Eng. Commun. Comput., 2001

2000

On the Optimal <sub>Integer 4</sub> Codes of Type II and Length 16.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Marcus Greferath

,

Stefan E. Schmidt

J. Comb. Theory A, 2000

1999

Monomial embeddings of the Klein curve.

[BibT_eX]

[DOI]

Iwan M. Duursma

Discret. Math., 1999

Split Weight Enumerators for the Preparata Codes with Applications to Designs.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

,

,

Kyeongcheol Yang

Des. Codes Cryptogr., 1999

A Riemann hypothesis analogue for self-dual codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

Proceedings of the Codes and Association Schemes, 1999

Speeding up the Discrete Log Computation on Curves with Automorphisms.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

Pierrick Gaudry

,

François Morain

Proceedings of the Advances in Cryptology, 1999

1998

Cyclic Subcodes of Generalized Reed-Muller Codes.

[BibT_eX]

[DOI]

,

Iwan M. Duursma

,

Jean-Pierre Cherdieu

,

Antoine Edouard

IEEE Trans. Inf. Theory, 1998

1997

Translates of linear codes over Z<sub>4</sub>.

[BibT_eX]

[DOI]

Alexis Bonnecaze

,

Iwan M. Duursma

IEEE Trans. Inf. Theory, 1997

1994

Error-locating pairs for cyclic codes.

[BibT_eX]

[DOI]

Iwan M. Duursma

,

IEEE Trans. Inf. Theory, 1994

1993

Algebraic decoding using special divisors.

[BibT_eX]

[DOI]

Iwan M. Duursma

IEEE Trans. Inf. Theory, 1993

Majority coset decoding.

[BibT_eX]

[DOI]

Iwan M. Duursma

IEEE Trans. Inf. Theory, 1993

Loading...