Omar Alrabiah

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Randomly punctured Reed--Solomon codes achieve list-decoding capacity over linear-sized fields (available as arXiv preprint)	N/A	Paper
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets (available as arXiv preprint)	N/A	Paper
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles (available as arXiv preprint)	N/A	Paper
Low-degree polynomials are good extractors	2026-09-11	Paper
AG codes have no list-decoding friends: approaching the generalized Singleton bound requires exponential alphabets IEEE Transactions on Information Theory	2025-07-11	Paper
AG codes have no list-decoding friends: approaching the generalized Singleton bound requires exponential alphabets	2024-11-28	Paper
Low-degree polynomials extract from local sources	2024-06-24	Paper
scientific article; zbMATH DE number 7768402 (Why is no real title available?) (available as arXiv preprint)	2023-11-20	Paper
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation	2023-08-29	Paper
An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes IEEE Transactions on Information Theory	2022-02-17	Paper
An exponential lower bound on the sub-packetization of MSR codes Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing	2020-01-30	Paper

Research outcomes over time

This page was built for person: Omar Alrabiah