Omar Alrabiah

According to our database, Omar Alrabiah authored at least 10 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Low-Degree Polynomials Are Good Extractors.

Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro

Electron. Colloquium Comput. Complex., 2024

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles.

Omar Alrabiah, Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2024

2023

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets.

Omar Alrabiah, Venkatesan Guruswami, Ray Li

Electron. Colloquium Comput. Complex., 2023

Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields.

Omar Alrabiah, Venkatesan Guruswami, Ray Li

Electron. Colloquium Comput. Complex., 2023

2022

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.

Omar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, Peter Manohar

Electron. Colloquium Comput. Complex., 2022

Low-Degree Polynomials Extract from Local Sources.

Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro

Electron. Colloquium Comput. Complex., 2022

2021

An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes.

Omar Alrabiah, Venkatesan Guruswami

IEEE Trans. Inf. Theory, 2021

Revisiting a Lower Bound on the Redundancy of Linear Batch Codes.

Omar Alrabiah, Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2021

Visible Rank and Codes with Locality.

Omar Alrabiah, Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2021

2019

An Exponential Lower Bound on the Sub-Packetization of MSR Codes.

Omar Alrabiah, Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2019