scientific article; zbMATH DE number 7376003
From MaRDI portal
Publication:5002755
DOI10.4230/LIPIcs.ICALP.2018.76MaRDI QIDQ5002755
Madhu Sudan, Bernhard Haeupler, Amirbehshad Shahrasbi
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1802.08663
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Insdel codes from subspace and rank-metric codes ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Efficient Linear and Affine Codes for Correcting Insertions/Deletions ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
Cites Work
- Unnamed Item
- A survey of results for deletion channels and related synchronization channels
- Linear-time list recovery of high-rate expander codes
- Some remarks on multiplicity codes
- Optimal Rate List Decoding via Derivative Codes
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Linear time encodable and list decodable codes
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Asymptotically good codes correcting insertions, deletions, and transpositions
- Synchronization strings
- Synchronization strings: explicit constructions, local decoding, and applications
- Deletion Codes in the High-Noise and High-Rate Regimes
- Automata, Languages and Programming
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
This page was built for publication:
