Skip to content

Author

Omar Alrabiah

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Combinatorial limitations of list-decoding Reed-Solomon codes

For infinitely many rates $R \in (0,1)$, we show that full-length Reed-Solomon codes over fields of low characteristic can contain super-polynomially many codewords in a Hamming ball of radius just exceeding the Johnson radius. Over prime fields, we exhibit full-length Reed-Solomon codes of constant rate $R$ with polyn...

Omar Alrabiah, Rohan Goyal, V. Guruswami · 0 citations
Oct 2026

Explicit Reed-Solomon Subspace Designs: Optimal List and Line Decoding

For any desired rate $R \in (0,1)$, and gap to list-decoding capacity $\varepsilon>0$, we give an explicit $n^{O_{\varepsilon}(1)}$ time construction of Reed-Solomon codes over extension fields of size polynomial in the block length $n$ that can be list-decoded from a fraction $1-R-\varepsilon$ of errors with the optim...

Omar Alrabiah, Rohan Goyal, V. Guruswami · 3 citations · ⚡1
Preprint Aug 2026

Binary code rate bounds via classical--quantum channels

We derive the four principal asymptotic rate-distance tradeoffs for binary codes---Plotkin, Elias--Bassalygo, and the two McEliece--Rodemich--Rumsey--Welch (MRRW) bounds---from one theorem, the ``pretty good criterion.''If the bit error rate under the pretty good measurement (PGM)---the quantum analog of posterior samp...

Omar Alrabiah, V. Guruswami · 4 citations · ⚡2

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.