98 citations · 214 across the 31 of their papers we have counts for
4 papers · 1 filter
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…
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…
Isometry-Dual Flags of AG Codes
Maria Bras-Amorós, Iwan Duursma, Euijin Hong
Consider a complete flag of one-point AG codes of length over the finite field . The codes are defined by evaluati…
Log-logarithmic Time Pruned Polar Coding
Hsin-Po Wang, Iwan Duursma
A pruned variant of polar coding is proposed for binary erasure channels. For sufficiently small , we construct a series of capacity achieving codes with block lengt…