Follow
Omar Alrabiah
Omar Alrabiah
Verified email at berkeley.edu
Title
Cited by
Cited by
Year
An exponential lower bound on the sub-packetization of MSR codes
O Alrabiah, V Guruswami
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
37*2019
Randomly punctured Reed--Solomon codes achieve list-decoding capacity over linear-sized fields
O Alrabiah, V Guruswami, R Li
arXiv preprint arXiv:2304.09445, 2023
152023
A near-cubic lower bound for 3-query locally decodable codes from semirandom CSP refutation
O Alrabiah, V Guruswami, PK Kothari, P Manohar
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1438-1448, 2023
112023
Low-degree polynomials extract from local sources
O Alrabiah, E Chattopadhyay, J Goodman, X Li, J Ribeiro
arXiv preprint arXiv:2205.13725, 2022
52022
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
O Alrabiah, V Guruswami, R Li
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
32024
Low-Degree Polynomials Are Good Extractors
O Alrabiah, J Goodman, J Mosheiff, J Ribeiro
arXiv preprint arXiv:2405.10297, 2024
12024
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
O Alrabiah, V Guruswami
arXiv preprint arXiv:2404.05864, 2024
12024
Visible rank and codes with locality
O Alrabiah, V Guruswami
arXiv preprint arXiv:2108.12687, 2021
12021
Revisiting a Lower Bound on the Redundancy of Linear Batch Codes
O Alrabiah, V Guruswami
Electron. Colloquium Comput. Complex. 28, 145, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–9