Name
Abstract | ||
|---|---|---|
We give a linear-time erasure list-decoding algorithm for expander codes. More precisely, let $r > 0$ be any integer. Given an inner code ${\mathcal {C}}_{0}$ of length $d$ , and ... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TIT.2021.3086805 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Graph theory,Linear codes,Decoding,Approximation algorithms,Standards,Labeling,Computer science | Journal | 67 |
Issue | ISSN | Citations |
9 | 0018-9448 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Ron-Zewi | 1 | 40 | 9.89 |
| Mary Wootters | 2 | 172 | 25.99 |
| Gilles Zémor | 3 | 29 | 5.60 |