List decoding from erasures: Bounds and code constructions
From MaRDI portal
Recommendations
- List decoding from erasures: bounds and code constructions
- Two theorems on list decoding (extended abstract)
- Linear-time list decoding in error-free settings (extended abstract)
- Combinatorial bounds for list decoding
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
Cited in
(11)- New constructions for IPP codes
- Erasure/List Random Coding Error Exponents Are Not Universally Achievable
- List decoding from erasures: bounds and code constructions
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
- Erasure, list, and detection zero-error capacities for low noise and a relation to identification
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Symmetric disjunctive list-decoding codes
- Linear-time list decoding in error-free settings (extended abstract)
- Erasure list-decodable codes and Turán hypercube problems
- Generic erasure correcting sets: bounds and constructions
- Query complexity in errorless hardness amplification
This page was built for publication: List decoding from erasures: Bounds and code constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474218)