Efficient Low-Redundancy Codes for Correcting Multiple Deletions

DOI10.1137/1.9781611974331.ch132zbMath1415.94477arXiv1507.06175OpenAlexW1504042137MaRDI QIDQ4575716

Joshua Brakensiek, Samuel Zbarsky, Venkatesan Guruswami

Publication date: 16 July 2018

Published in: IEEE Transactions on Information Theory, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (4)

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 ⋮ Information-Theoretic Foundations of DNA Data Storage

This page was built for publication: Efficient Low-Redundancy Codes for Correcting Multiple Deletions