# Efficient Linear and Affine Codes for Correcting Insertions/Deletions

@inproceedings{Cheng2021EfficientLA,
title={Efficient Linear and Affine Codes for Correcting Insertions/Deletions},
author={K. Cheng and V. Guruswami and Bernhard Haeupler and X. Li},
booktitle={SODA},
year={2021}
}
• K. Cheng, +1 author X. Li
• Published in SODA 2021
• Computer Science, Mathematics
This paper studies \emph{linear} and \emph{affine} error-correcting codes for correcting synchronization errors such as insertions and deletions. We call such codes linear/affine insdel codes. Linear codes that can correct even a single deletion are limited to have information rate at most $1/2$ (achieved by the trivial 2-fold repetition code). Previously, it was (erroneously) reported that more generally no non-trivial linear codes correcting $k$ deletions exist, i.e., that the $(k+1)$-fold… Expand
4 Citations

#### References

SHOWING 1-10 OF 22 REFERENCES
On Linear and Cyclic Codes for Correcting Deletions
• Computer Science
• 2007 IEEE International Symposium on Information Theory
• 2007
• 6
• Highly Influential
Optimally resilient codes for list-decoding from insertions and deletions
• Mathematics, Computer Science
• Electron. Colloquium Comput. Complex.
• 2019
• 11
• PDF
Optimal k-Deletion Correcting Codes
• Computer Science, Mathematics
• 2019 IEEE International Symposium on Information Theory (ISIT)
• 2019
• 24
• PDF
On the List Decodability of Insertions and Deletions
• Physics, Mathematics
• 2018 IEEE International Symposium on Information Theory (ISIT)
• 2018
• 8
• PDF
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors
• Kuan Cheng, Xin Li
• Mathematics, Computer Science
• 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018
• 33
• Highly Influential
• PDF
An Improved Bound on the Fraction of Correctable Deletions
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2017
• 35
• PDF