research
∙
09/16/2019
On Decoding Cohen-Haeupler-Schulman Tree Codes
Tree codes, introduced by Schulman, are combinatorial structures essenti...
share
research
∙
12/28/2017
Nearly linear time encodable codes beating the Gilbert-Varshamov bound
We construct explicit nearly linear time encodable error-correcting code...
research
∙
12/02/2017
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields
We present a novel randomized algorithm to factor polynomials over a fin...
research
∙
06/14/2016
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
The fastest known algorithm for factoring univariate polynomials over fi...
research
∙
06/02/2016