Omar Alrabiah

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 24

Top Topics

Reed Solomon Codes

Agnostic Learning

Error Correction

Top Venues

Electron. Colloquium Comput. Complex.

IEEE Trans. Inf. Theory

Publications

Omar Alrabiah, Venkatesan Guruswami, Ray Li
Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. STOC (2024)
Omar Alrabiah, Venkatesan Guruswami
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles. CoRR (2024)
Omar Alrabiah, Venkatesan Guruswami
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles. Electron. Colloquium Comput. Complex. (2024)
Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro
Low-Degree Polynomials Are Good Extractors. Electron. Colloquium Comput. Complex. (2024)
Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro
Low-Degree Polynomials Are Good Extractors. CoRR (2024)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. SODA (2024)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. CoRR (2023)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. Electron. Colloquium Comput. Complex. (2023)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. CoRR (2023)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. Electron. Colloquium Comput. Complex. (2023)
Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. STOC (2023)
Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. CoRR (2023)
Omar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, Peter Manohar
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Electron. Colloquium Comput. Complex. (2022)
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João L. Ribeiro
Low-Degree Polynomials Extract From Local Sources. ICALP (2022)
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João L. Ribeiro
Low-Degree Polynomials Extract from Local Sources. CoRR (2022)
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João L. Ribeiro
Low-Degree Polynomials Extract from Local Sources. Electron. Colloquium Comput. Complex. (2022)
Omar Alrabiah, Venkatesan Guruswami
Revisiting a Lower Bound on the Redundancy of Linear Batch Codes. Electron. Colloquium Comput. Complex. 28 (2021)
Omar Alrabiah, Venkatesan Guruswami
Visible Rank and Codes with Locality. APPROX-RANDOM (2021)
Omar Alrabiah, Venkatesan Guruswami
Visible Rank and Codes with Locality. CoRR (2021)
Omar Alrabiah, Venkatesan Guruswami
Visible Rank and Codes with Locality. Electron. Colloquium Comput. Complex. 28 (2021)
Omar Alrabiah, Venkatesan Guruswami
An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 67 (12) (2021)
Omar Alrabiah, Venkatesan Guruswami
An exponential lower bound on the sub-packetization of MSR codes. STOC (2019)
Omar Alrabiah, Venkatesan Guruswami
An Exponential Lower Bound on the Sub-Packetization of MSR Codes. CoRR (2019)
Omar Alrabiah, Venkatesan Guruswami
An Exponential Lower Bound on the Sub-Packetization of MSR Codes. Electron. Colloquium Comput. Complex. 26 (2019)