An exponential lower bound on the sub-packetization of MSR codes. - Omar Alrabiah; Venkatesan Guruswami (STOC, 2019)

Visible Rank and Codes with Locality. - Omar Alrabiah; Venkatesan Guruswami (APPROX-RANDOM, 2021)

Revisiting a Lower Bound on the Redundancy of Linear Batch Codes. - Omar Alrabiah; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2021)

An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes. - Omar Alrabiah; Venkatesan Guruswami (IEEE Trans. Inf. Theory, 2021)

Low-Degree Polynomials Extract From Local Sources. - Omar Alrabiah; Eshan Chattopadhyay; Jesse Goodman; Xin Li 006; João Ribeiro 002 (ICALP, 2022)

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. - Omar Alrabiah; Venkatesan Guruswami; Pravesh K. Kothari; Peter Manohar (STOC, 2023)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles. - Omar Alrabiah; Venkatesan Guruswami (FOCS, 2024)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. - Omar Alrabiah; Venkatesan Guruswami; Ray Li (SODA, 2024)

Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. - Omar Alrabiah; Venkatesan Guruswami; Ray Li (STOC, 2024)

Low-Degree Polynomials Are Good Extractors. - Omar Alrabiah; Jesse Goodman; Jonathan Mosheiff; João Ribeiro 002 (APPROX/RANDOM, 2025)

Ideal Pseudorandom Codes. - Omar Alrabiah; Prabhanjan Ananth; Miranda Christ; Yevgeniy Dodis; Sam Gunn (STOC, 2025)