Synchronization strings: explicit constructions, local decoding, and applications
From MaRDI portal
Publication:5230342
DOI10.1145/3188745.3188940zbMath1446.94203arXiv1710.09795OpenAlexW2963700977MaRDI QIDQ5230342
Amirbehshad Shahrasbi, Bernhard Haeupler
Publication date: 22 August 2019
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.09795
Related Items (6)
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
This page was built for publication: Synchronization strings: explicit constructions, local decoding, and applications