Locally Decodable Codes for Edit Distance
From MaRDI portal
Publication:2947534
DOI10.1007/978-3-319-17470-9_14zbMath1359.94730OpenAlexW2130786088MaRDI QIDQ2947534
Rafail Ostrovsky, Anat Paskin-Cherniavsky
Publication date: 24 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_14
Related Items
Cites Work
- Unnamed Item
- Spot-checkers
- Public Key Locally Decodable Codes with Short Keys
- Short Locally Testable Codes and Proofs
- On the efficiency of local decoding procedures for error-correcting codes
- Sorting and searching in the presence of memory faults (without redundancy)
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults
- Coping with errors in binary search procedures (Preliminary Report)
- Locally Decodable Codes
This page was built for publication: Locally Decodable Codes for Edit Distance