3 papers
cs.CC2026
A Forward-Backward Weight Analysis of INW for Permutation Branching Programs
Gil Cohen, Dean Doron, Noam Goldgraber
We construct an -error PRG for permutation read-once branching programs of length and width with seed length \[ O\left((\log w+\log(1/\varepsilon))\cdot \log n…
cs.CC2026
Optimal PRGs for Low-Degree Polynomials over Polynomial-Size Fields
Gil Cohen, Dean Doron, Noam Goldgraber
Pseudorandom generators (PRGs) for low-degree polynomials are a central object in pseudorandomness, with applications to circuit lower bounds and derandomization. Viola's celebrate…
cs.IT2025
Tracing AG Codes: Toward Meeting the Gilbert-Varshamov Bound
Gil Cohen, Dean Doron, Noam Goldgraber +1
One of the oldest problems in coding theory is to match the Gilbert-Varshamov bound with explicit binary codes. Over larger-yet still constant-sized-fields, algebraic-geometry code…