1 citations · 2 across the 9 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.CR2024
Ideal Pseudorandom Codes
Omar Alrabiah, Prabhanjan Ananth, Miranda Christ +2
Pseudorandom codes are error-correcting codes with the property that no efficient adversary can distinguish encodings from uniformly random strings. They were recently introduced b…
cs.CC2024
Low-Degree Polynomials Are Good Extractors
Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff +1
We prove that random low-degree polynomials (over ) are unbiased, in an extremely general sense. That is, we show that random low-degree polynomials are good randomne…
cs.IT2024
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
Omar Alrabiah, Venkatesan Guruswami
We prove that a binary linear code of block length that is locally correctable with queries against a fraction of adversarial errors must have dimension at most $O_δ…