5 papers · 1 filter
Algebraic-Geometric Parvaresh--Vardy Subspace Designs and Rank Condensers
Gil Cohen, Dean Doron, Noam Goldgraber
A subspace design is a collection of subspaces of with the property that no low-dimensional subspace intersects the collection "too much". Sub…
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…
The Insertion List-Decoding Capacity and an Improved Bound on the Deletion List-Decoding Capacity
Roni Con, Dean Doron, João Ribeiro
Informally, the capacity of list-decoding in a given adversarial error model is the largest rate at which we can list-decode with list size polynomial in the block length. The capa…
Discrepancy for Random Linear Codes
Dean Doron, Tal Leonov, Jonathan Mosheiff +3
We show that random linear codes (RLCs) possess nearly optimal discrepancy-type properties in a broad range of settings. Our main results are two general discrepancy theorems: one…
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…