Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets

DOI10.1137/1.9781611975482.132zbMath1432.68604arXiv1803.03530OpenAlexW4229748781MaRDI QIDQ5236319

Kuan Cheng, Amirbehshad Shahrasbi, Bernhard Haeupler, Ke Wu, Xin Li

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.03530

Mathematics Subject Classification ID

Algorithms on strings (68W32) Synchronization error-correcting codes (94B50)

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 ⋮ Unnamed Item

This page was built for publication: Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets