Linear-time list decoding in error-free settings (extended abstract)
From MaRDI portal
Recommendations
Cited in
(8)- List decoding from erasures: bounds and code constructions
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Linear time encodable and list decodable codes
- List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
- List decoding from erasures: Bounds and code constructions
- Linear time recognition of optimal L-restricted prefix codes. (Extended abstract)
- Synchronization strings: list decoding for insertions and deletions
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
This page was built for publication: Linear-time list decoding in error-free settings (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466505)