Name
Abstract | ||
|---|---|---|
AbstractIn a recent article, Kim and Kopparty (2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid S1 × … × Sm. We show that their algorithm can be adapted to solve the unique decoding problem for the general family of Downset codes. Here, a downset code is specified by a family D of monomials closed under taking factors: The corresponding code is the space of evaluations of all polynomials that can be written as linear combinations of monomials from D. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3417754 | ACM Transactions on Computation Theory |
Keywords | DocType | Volume |
Downset, downset code, Reed-Solomon code, Reed-Muller code, minimum distance, weighted function, weighted distance, unique decoding | Journal | 12 |
Issue | ISSN | Citations |
4 | 1942-3454 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Srikanth Srinivasan | 1 | 132 | 21.31 |
| Utkarsh Tripathi | 2 | 1 | 3.05 |
| S. Venkitesh | 3 | 1 | 3.05 |