Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps CB2JWNS1E9
| URI | m2://res/CB2JWNS1E9 |
|---|---|
| Kind | preprint |
| Creators | Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi |
| Date | 2026-10-06 |
| MSC | 05-XX |
| Subjects | arxiv cs.CC, arxiv cs.IT, arxiv math.IT |
| Scope | in |
Expressions
e1: version, preprint
| Language | en |
|---|---|
| Date | 2026-10-06 |
| Ids | arXiv 2610.08610 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| 1R9PC4J5WZ | statement | lemma 6.7 | arxiv |
| informal | statement | lemma 6.2 | arxiv |
| 5519YMHYTZ | statement | fact 4.3 | arxiv |
| 58TZC3M4YN | statement | fact C.2 | arxiv |
| 660PMX1HHW | statement | lemma 6.1 | arxiv |
| image of a rational map on an open set (cf. | statement | fact 6.8 | arxiv |
| CZM6Y1KWEX | statement | corollary 4.2 | arxiv |
| DN9KQWMAP1 | statement | theorem | arxiv |
| relating discrete and continuous simplex | statement | lemma 4.1 | arxiv |
| number of bivariate monomials with weighted-degree bound | statement | fact 2.1 | arxiv |
| F86M7Y7PH7 | statement | lemma 6.6 | arxiv |
| Basic properties of the operator $\mathcal{D}$ | statement | proposition C.3 | arxiv |
| FH23BZCN24 | statement | fact 6.3 | arxiv |
| Computing an interpolant over $\F(Z)$ | statement | lemma 6.5 | arxiv |
| Image of a rational map on an open set | statement | fact A.3 | arxiv |
| HXW6HC6C1R | statement | lemma C.1 | arxiv |
| JEMY5N2QH9 | statement | corollary 6.9 | arxiv |
| MX4YFE5MM1 | statement | theorem 1.2 | arxiv |
| \Bezout's theorem | statement | theorem A.2 | arxiv |
| P7BBKBTEA2 | statement | theorem 1.1 | arxiv |
| R6B6AFCD05 | statement | theorem 3.3 | arxiv |
| Algebraic varieties: irreducibility, dimension and degree | definition | definition A.1 | arxiv |
| ZTVR4KDAQA | statement | lemma 3.1 | arxiv |
Catalogue records
- arxiv: 2610.08610 (work)
- arxiv_text: 2610.08610 (work)