Name
Abstract | ||
|---|---|---|
A family of error-correcting codes is list-decodable from error fraction $p$ if, for every code in the family, the number of codewords in any Hamming ball of fractional radius $p$ is less than some integer $L$ ... |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TIT.2021.3127126 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Linear codes,Codes,Decoding,Computer science,Standards,Additives,Upper bound | Journal | 68 |
Issue | ISSN | Citations |
2 | 0018-9448 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Guruswami | 1 | 3205 | 247.96 |
| Ray Li | 2 | 3 | 3.09 |
| Jonathan Mosheiff | 3 | 1 | 1.73 |
| Nicolas Resch | 4 | 4 | 2.80 |
| Shashwat Silas | 5 | 0 | 1.35 |
| Mary Wootters | 6 | 0 | 0.68 |