![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Iwan M. Duursma
Person information
- affiliation: University of Illinois at Urbana-Champaign, Department of Mathematics
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j34]Iwan M. Duursma, Hsin-Po Wang
:
Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction. Appl. Algebra Eng. Commun. Comput. 34(4): 717-743 (2023) - 2022
- [j33]Iwan M. Duursma
, Xiao Li:
Johnson graph codes. Des. Codes Cryptogr. 90(12): 2923-2941 (2022) - 2021
- [j32]Iwan M. Duursma, Xiao Li, Hsin-Po Wang
:
Multilinear Algebra for Distributed Storage. SIAM J. Appl. Algebra Geom. 5(3): 552-587 (2021) - [j31]Hsin-Po Wang
, Iwan M. Duursma
:
Polar Codes' Simplicity, Random Codes' Durability. IEEE Trans. Inf. Theory 67(3): 1478-1508 (2021) - [j30]Hsin-Po Wang
, Iwan M. Duursma
:
Log-Logarithmic Time Pruned Polar Coding. IEEE Trans. Inf. Theory 67(3): 1509-1521 (2021) - 2020
- [j29]Maria Bras-Amorós
, Iwan M. Duursma, Euijin Hong:
Isometry-dual flags of AG codes. Des. Codes Cryptogr. 88(8): 1617-1638 (2020) - 2019
- [j28]Iwan M. Duursma
:
Matrix theory for minimal trellises. Des. Codes Cryptogr. 87(11): 2507-2536 (2019) - [j27]Wael Halbawi
, Zihan Liu, Iwan M. Duursma, Hoang Dau
, Babak Hassibi:
Sparse and Balanced Reed-Solomon and Tamo-Barg Codes. IEEE Trans. Inf. Theory 65(1): 118-130 (2019) - [j26]Iwan M. Duursma
:
Shortened Regenerating Codes. IEEE Trans. Inf. Theory 65(2): 1000-1007 (2019) - [j25]Swanand Kadhe
, Salim Y. El Rouayheb, Iwan M. Duursma
, Alex Sprintson
:
Codes With Locality in the Rank and Subspace Metrics. IEEE Trans. Inf. Theory 65(9): 5454-5468 (2019) - 2018
- [j24]Iván Blanco-Chacón, Eimear Byrne
, Iwan M. Duursma, John Sheekey
:
Rank metric codes and zeta functions. Des. Codes Cryptogr. 86(8): 1767-1792 (2018) - [j23]Hoang Dau
, Iwan M. Duursma
, Han Mao Kiah
, Olgica Milenkovic:
Repairing Reed-Solomon Codes With Multiple Erasures. IEEE Trans. Inf. Theory 64(10): 6567-6582 (2018) - 2013
- [j22]Alain Couvreur, Iwan M. Duursma:
Evaluation codes from smooth quadric surfaces and twisted Segre varieties. Des. Codes Cryptogr. 66(1-3): 291-303 (2013) - 2012
- [j21]Iwan M. Duursma, Seungkook Park
:
Delta sets for divisors supported in two points. Finite Fields Their Appl. 18(5): 865-885 (2012) - 2011
- [j20]Iwan M. Duursma:
Two-Point Coordinate Rings for GK-Curves. IEEE Trans. Inf. Theory 57(2): 593-600 (2011) - [j19]Iwan M. Duursma, Radoslav Kirov:
Improved Two-Point Codes on Hermitian Curves. IEEE Trans. Inf. Theory 57(7): 4469-4476 (2011) - 2010
- [j18]Iwan M. Duursma, Seungkook Park
:
Coset bounds for algebraic geometric codes. Finite Fields Their Appl. 16(1): 36-55 (2010) - [j17]Iwan M. Duursma:
Binomial moments for divisible self-dual codes. Int. J. Inf. Coding Theory 1(2): 191-199 (2010) - 2006
- [j16]Iwan M. Duursma, Ruud Pellikaan:
A symmetric Roos bound for linear codes. J. Comb. Theory A 113(8): 1677-1688 (2006) - 2005
- [j15]Iwan M. Duursma, Hyang-Sook Lee:
A group key agreement protocol from pairings. Appl. Math. Comput. 167(2): 1451-1456 (2005) - 2003
- [j14]Iwan M. Duursma:
Extremal weight enumerators and ultraspherical polynomials. Discret. Math. 268(1-3): 103-127 (2003) - [j13]Chien-Yu Chen, Iwan M. Duursma:
Geometric Reed-Solomon codes of length 64 and 65 over F8. IEEE Trans. Inf. Theory 49(5): 1351-1353 (2003) - 2001
- [j12]Iwan M. Duursma, Carlos Rentería-Márquez
, Horacio Tapia-Recillas:
Reed-Muller Codes on Complete Intersections. Appl. Algebra Eng. Commun. Comput. 11(6): 455-462 (2001) - [j11]Iwan M. Duursma:
From weight enumerators to zeta functions. Discret. Appl. Math. 111(1-2): 55-73 (2001) - [j10]Iwan M. Duursma:
Preparata codes through lattices. IEEE Trans. Inf. Theory 47(1): 36-44 (2001) - [j9]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 Trans. Inf. Theory 47(4): 1596-1598 (2001) - 2000
- [j8]Iwan M. Duursma, Marcus Greferath, Stefan E. Schmidt:
On the Optimal Integer 4 Codes of Type II and Length 16. J. Comb. Theory A 92(1): 77-82 (2000) - 1999
- [j7]Iwan M. Duursma, Tor Helleseth, Chunming Rong
, Kyeongcheol Yang:
Split Weight Enumerators for the Preparata Codes with Applications to Designs. Des. Codes Cryptogr. 18(1/3): 103-124 (1999) - [j6]Iwan M. Duursma:
Monomial embeddings of the Klein curve. Discret. Math. 208-209: 235-246 (1999) - 1998
- [j5]Oscar Moreno, Iwan M. Duursma, Jean-Pierre Cherdieu, Antoine Edouard:
Cyclic Subcodes of Generalized Reed-Muller Codes. IEEE Trans. Inf. Theory 44(1): 307-311 (1998) - 1997
- [j4]Alexis Bonnecaze, Iwan M. Duursma:
Translates of linear codes over Z4. IEEE Trans. Inf. Theory 43(4): 1218-1230 (1997) - 1994
- [j3]Iwan M. Duursma, Ralf Kötter:
Error-locating pairs for cyclic codes. IEEE Trans. Inf. Theory 40(4): 1108-1121 (1994) - 1993
- [j2]Iwan M. Duursma:
Algebraic decoding using special divisors. IEEE Trans. Inf. Theory 39(2): 694-698 (1993) - [j1]Iwan M. Duursma:
Majority coset decoding. IEEE Trans. Inf. Theory 39(3): 1067-1070 (1993)
Conference and Workshop Papers
- 2022
- [c17]Iwan M. Duursma
, Ryan Gabrys
, Venkatesan Guruswami
, Ting-Chun Lin
, Hsin-Po Wang
:
Accelerating Polarization via Alphabet Extension. APPROX/RANDOM 2022: 17:1-17:15 - 2018
- [c16]Hoang Dau
, Iwan M. Duursma, Hien Chu:
On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes. ISIT 2018: 1700-1704 - 2017
- [c15]Hoang Dau
, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing reed-solomon codes with two erasures. ISIT 2017: 351-355 - [c14]Xiao Li, Iwan M. Duursma:
Sector-disk codes with three global parities. ISIT 2017: 614-618 - [c13]Wael Halbawi, Iwan M. Duursma, Hoang Dau
, Babak Hassibi:
Balanced and sparse Tamo-Barg codes. ISIT 2017: 1018-1022 - [c12]Iwan M. Duursma, Hoang Dau
:
Low bandwidth repair of the RS(10, 4) Reed-Solomon code. ITA 2017: 1-10 - 2016
- [c11]Swanand Kadhe
, Salim Y. El Rouayheb, Iwan M. Duursma, Alex Sprintson:
Rank-metric codes with local recoverability. Allerton 2016: 1033-1040 - 2014
- [c10]Wael Halbawi, Tracey Ho, Hongyi Yao, Iwan M. Duursma:
Distributed reed-solomon codes for simple multiple access networks. ISIT 2014: 651-655 - [c9]Wael Halbawi, Tracey Ho, Iwan M. Duursma:
Distributed gabidulin codes for multiple-source network error correction. NetCod 2014: 1-6 - 2012
- [c8]Iwan M. Duursma, Jiashun Shen:
Multiplicative secret sharing schemes from Reed-Muller type codes. ISIT 2012: 264-268 - 2009
- [c7]Iwan M. Duursma, Radoslav Kirov:
An Extension of the Order Bound for AG Codes. AAECC 2009: 11-22 - 2004
- [c6]Negar Kiyavash, Iwan M. Duursma:
On the vector decomposition problem for m-torsion points on an elliptic curve. ISIT 2004: 548 - 2003
- [c5]Iwan M. Duursma, Hyang-Sook Lee:
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d. ASIACRYPT 2003: 111-123 - [c4]Iwan M. Duursma:
Combinatorics of the Two-Variable Zeta Function. International Conference on Finite Fields and Applications 2003: 109-136 - [c3]Iwan M. Duursma, Bjorn Poonen, Michael Zieve:
Everywhere Ramified Towers of Global Function Fields. International Conference on Finite Fields and Applications 2003: 148-153 - 1999
- [c2]Iwan M. Duursma, Pierrick Gaudry, François Morain:
Speeding up the Discrete Log Computation on Curves with Automorphisms. ASIACRYPT 1999: 103-121 - [c1]Iwan M. Duursma:
A Riemann hypothesis analogue for self-dual codes. Codes and Association Schemes 1999: 115-124
Informal and Other Publications
- 2022
- [i27]Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang:
Accelerating Polarization via Alphabet Extension. CoRR abs/2207.04522 (2022) - 2020
- [i26]Iwan M. Duursma, Xiao Li, Hsin-Po Wang
:
Multilinear Algebra for Distributed Storage. CoRR abs/2006.08911 (2020) - [i25]Iwan M. Duursma, Hsin-Po Wang
:
Multilinear Algebra for Minimum Storage Regenerating Codes. CoRR abs/2006.16998 (2020) - [i24]Hsin-Po Wang, Iwan M. Duursma:
Parity-Checked Strassen Algorithm. CoRR abs/2011.15082 (2020) - 2019
- [i23]Hsin-Po Wang
, Iwan M. Duursma:
Log-logarithmic Time Pruned Polar Coding. CoRR abs/1905.13340 (2019) - [i22]Maria Bras-Amorós, Iwan M. Duursma, Euijin Hong:
Isometry-Dual Flags of AG Codes. CoRR abs/1906.10620 (2019) - [i21]Hsin-Po Wang
, Iwan M. Duursma:
Polar Codes' Simplicity, Random Codes' Durability. CoRR abs/1912.08995 (2019) - [i20]Iwan M. Duursma, Xiao Li:
Johnson Graph Codes. CoRR abs/1912.10388 (2019) - 2018
- [i19]Hoang Dau, Iwan M. Duursma, Hien Chu:
On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes. CoRR abs/1801.05101 (2018) - [i18]Hsin-Po Wang
, Iwan M. Duursma:
Polar Code Moderate Deviation: Recovering the Scaling Exponent. CoRR abs/1806.02405 (2018) - [i17]Hsin-Po Wang
, Iwan M. Duursma:
Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels. CoRR abs/1812.08106 (2018) - [i16]Hsin-Po Wang
, Iwan M. Duursma:
Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability. CoRR abs/1812.08112 (2018) - 2017
- [i15]Son Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing Reed-Solomon Codes With Two Erasures. CoRR abs/1701.07118 (2017) - [i14]Swanand Kadhe, Salim Y. El Rouayheb, Iwan M. Duursma, Alex Sprintson:
Rank-Metric Codes with Local Recoverability. CoRR abs/1707.05944 (2017) - 2016
- [i13]Son Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing Reed-Solomon Codes With Multiple Erasures. CoRR abs/1612.01361 (2016) - 2015
- [i12]Iwan M. Duursma:
Shortened regenerating codes. CoRR abs/1505.00178 (2015) - [i11]Iwan M. Duursma:
Matrix Theory for Minimal Trellises. CoRR abs/1509.08376 (2015) - 2014
- [i10]Iwan M. Duursma:
Outer bounds for exact repair codes. CoRR abs/1406.4852 (2014) - 2013
- [i9]Wael Halbawi, Tracey Ho, Hongyi Yao, Iwan M. Duursma:
Distributed Reed-Solomon Codes for Simple Multiple Access Networks. CoRR abs/1310.5187 (2013) - [i8]Abdulla Eid, Iwan M. Duursma:
Using concatenated algebraic geometry codes in channel polarization. CoRR abs/1310.7159 (2013) - 2011
- [i7]Alain Couvreur, Iwan M. Duursma:
Evaluation Codes from smooth Quadric Surfaces and Twisted Segre Varieties. CoRR abs/1101.4603 (2011) - 2010
- [i6]Iwan M. Duursma, Radoslav Kirov, Seungkook Park:
Distance bounds for algebraic geometric codes. CoRR abs/1001.1374 (2010) - [i5]Iwan M. Duursma, Radoslav Kirov:
Improved Two-Point Codes on Hermitian Curves. CoRR abs/1004.1752 (2010) - 2009
- [i4]Iwan M. Duursma, Radoslav Kirov:
An extension of the order bound for AG codes. CoRR abs/0901.2864 (2009) - 2006
- [i3]Iwan M. Duursma, Seungkook Park:
ElGamal type signature schemes for n-dimensional vector spaces. IACR Cryptol. ePrint Arch. 2006: 312 (2006) - 2005
- [i2]Iwan M. Duursma, Negar Kiyavash:
The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2005: 31 (2005) - 2003
- [i1]Iwan M. Duursma, Hyang-Sook Lee:
Tate-pairing implementations for tripartite key agreement. IACR Cryptol. ePrint Arch. 2003: 53 (2003)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint