( en | de | ru )

 

Disambiguation of "Alrabiah, Omar"

Author of the publication

copydeleteadd this publication to your clipboard
Revisiting a Lower Bound on the Redundancy of Linear Batch Codes.

, and . Electron. Colloquium Comput. Complex., (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Omar Ahmad-Omar

Nora Omar Mahmoud

Sanaa Hamdy Omar

Ahmed Said Omar

Imad al- Omari

 

Other publications of authors with the same name

Revisiting a Lower Bound on the Redundancy of Linear Batch Codes., and . Electron. Colloquium Comput. Complex., (2021)An Exponential Lower Bound on the Sub-Packetization of MSR Codes., and . Electron. Colloquium Comput. Complex., (2019)A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation., , , and . Electron. Colloquium Comput. Complex., (2022)An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes., and . IEEE Trans. Inf. Theory, 67 (12): 8086-8093 (2021)Visible Rank and Codes with Locality., and . APPROX-RANDOM, volume 207 of LIPIcs, page 57:1-57:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields., , and . CoRR, (2023)AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets., , and . CoRR, (2023)A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation., , , and . STOC, page 1438-1448. ACM, (2023)Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles., and . CoRR, (2024)AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets., , and . SODA, page 1367-1378. SIAM, (2024)