Name
Abstract | ||
|---|---|---|
We analyze the list-decodability, and related notions, of random linear codes. This has been studied extensively before: there are many different parameter regimes and many different variants. Previous works have used complementary styles of arguments---which each work in their own parameter regimes but not in others---and moreover have left some gaps in our understanding of the list-decodability of random linear codes. In particular, none of these arguments work well for list-recovery, a generalization of list-decoding that has been useful in a variety of settings.
In this work, we present a new approach, which works across parameter regimes and further generalizes to list-recovery. In particular, our argument provides better results for list-decoding and list-recovery over large fields; improved (quasipolynomial) list sizees for high-rate list-recovery of random linear codes; improved algorithmic results for list-decoding; and optimal average-radius list-decoding over constant-sized alphabets.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.5555/3174304.3175312 | SODA '18: Symposium on Discrete Algorithms
New Orleans
Louisiana
January, 2018 |
Field | DocType | ISBN |
Generating function,Discrete mathematics,Computer science | Conference | 978-1-61197-503-1 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Atri Rudra | 1 | 601 | 62.87 |
| Mary Wootters | 2 | 172 | 25.99 |