activity
20032022
most citedRepairing Reed-Solomon Codes With Multiple Erasures

98 citations · 214 across the 31 of their papers we have counts for

collaborators

34 papers

cs.IT2022

Accelerating Polarization via Alphabet Extension

Iwan Duursma, Ryan Gabrys, Venkatesan Guruswami +2

Polarization is an unprecedented coding technique in that it not only achieves channel capacity, but also does so at a faster speed of convergence than any other coding technique.…

cs.IT2020★ 3 cited

Parity-Checked Strassen Algorithm

Hsin-Po Wang, Iwan Duursma

To multiply astronomic matrices using parallel workers subject to straggling, we recommend interleaving checksums with some fast matrix multiplication algorithms. Nesting the parit…

cs.IT2020★ 11 cited

Multilinear Algebra for Minimum Storage Regenerating Codes

Iwan Duursma, Hsin-Po Wang

An -MSR (minimum storage regeneration) code is a set of nodes used to store a file. For a file of total size , each node stores symbols, any nodes rec…

cs.IT2020★ 11 cited

Multilinear Algebra for Distributed Storage

Iwan Duursma, Xiao Li, Hsin-Po Wang

An -ERRC (exact-repair regenerating code) is a collection of nodes used to store a file. For a file of total size , each node stores symbols, any …

math.CO2019

Johnson Graph Codes

Iwan Duursma, Xiao Li

We define a Johnson graph code as a subspace of labelings of the vertices in a Johnson graph with the property that labelings are uniquely determined by their restriction to vertex…

cs.IT2019★ 18 cited

Polar Codes' Simplicity, Random Codes' Durability

Hsin-Po Wang, Iwan Duursma

Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and de…