We construct explicit hitting set generators for $\mathbb{F}_2$-polynomials in $n$ variables of degree at most $d$ with an almost optimal density, and seed length $O(d \log n+d^2)$, which is optimal for $d = O(\log n)$.

Second, we address large-field hitting set generators. The influential state-of-the-art construction by Guruswami and Xing ... more >>>

Finding good tree code constructions is among the most natural questions in error-correcting codes over the Hamming channel. Unlike the usual setting, where one encodes a single message against adversarial errors, tree codes allow a sender to encode and send a stream, in an online manner, while protecting it from ... more >>>

Residual-String Equality, denoted $\text{ResStringEq}$, is the property consisting of all pairs of strings over $\{0,1,*\}$ that are equal after deleting all `$*$' symbols from them. This property was first introduced by Fischer, Magniez, and Starikovskaya (SODA 2018), who used it to show a lower bound on testing the $\text{Dyck}$ languages, ... more >>>