Efficient Linear and Affine Codes for Correcting Insertions/Deletions
From MaRDI portal
Publication:6156613
DOI10.1137/21m142798xzbMath1528.94107arXiv2007.09075OpenAlexW4379984077MaRDI QIDQ6156613
Bernhard Haeupler, Xin Li, Kuan Cheng, Venkatesan Guruswami
Publication date: 14 June 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.09075
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial codes (94B25) Decoding (94B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Improved Bound on the Fraction of Correctable Deletions
- Linear-time encodable and decodable error-correcting codes
- Simple Constructions of Almost k-wise Independent Random Variables
- Asymptotically good codes correcting insertions, deletions, and transpositions
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions
- Guess & Check Codes for Deletions, Insertions, and Synchronization
- List Decoding of Insertions and Deletions
- Synchronization strings
- On Optimal k-Deletion Correcting Codes
- Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
- Optimally resilient codes for list-decoding from insertions and deletions
- Near-linear time insertion-deletion codes and (1+ ε )-approximating edit distance via indexing
- Synchronization strings: explicit constructions, local decoding, and applications
- Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets
- Deletion Codes in the High-Noise and High-Rate Regimes
This page was built for publication: Efficient Linear and Affine Codes for Correcting Insertions/Deletions
