Locally decodable codes for edit distance

DOI10.1007/978-3-319-17470-9_14MaRDI QIDQ2947534zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Recommendations

• Locally Decodable Codes
• Locally updatable and locally decodable codes
• Locally decodable codes: a brief survey
• Corruption and Recovery-Efficient Locally Decodable Codes
• Locally decodable codes

Cites work

• scientific article; zbMATH DE number 6472644 (Why is no real title available?)
• Coping with errors in binary search procedures (Preliminary Report)
• Locally Decodable Codes
• On the efficiency of local decoding procedures for error-correcting codes
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Public key locally decodable codes with short keys
• Short locally testable codes and proofs
• Sorting and searching in the presence of memory faults (without redundancy)
• Spot-checkers

Cited in

(2)

• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• Locally updatable and locally decodable codes

This page was built for publication: Locally decodable codes for edit distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947534)