# Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions

@article{Con2022ExplicitAE,
title={Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions},
author={Roni Con and Amir Shpilka and Itzhak Tamo},
journal={IEEE Transactions on Information Theory},
year={2022},
volume={68},
pages={6516-6526}
}
• Published 16 January 2022
• Computer Science
• IEEE Transactions on Information Theory
In this work, we study linear error-correcting codes against adversarial insertion-deletion (insdel) errors, a topic that has recently gained a lot of attention. We construct linear codes over <inline-formula> <tex-math notation="LaTeX">$\mathbb {F}_{q}$ </tex-math></inline-formula>, for <inline-formula> <tex-math notation="LaTeX">$q= {\mathrm {poly}}(1/\varepsilon)$ </tex-math></inline-formula>, that can efficiently decode from a <inline-formula> <tex-math notation="LaTeX">$\delta$ </tex-math…

## References

SHOWING 1-10 OF 31 REFERENCES

• Computer Science
IEEE Transactions on Information Theory
• 2018
This work considers the problem of constructing binary codes to recover from bit deletions with efficient encoding/decoding, and constructs a binary code with redundancy that can be decoded from <inline-formula> <tex-math notation="LaTeX">$k$ </tex-Math></inline- formula>-fold repetition code.
• Computer Science
IEEE Transactions on Information Theory
• 2021
An explicit construction of length-based binary codes capable of correcting the deletion of two bits that have size, based on augmenting the classic Varshamov-Tenengolts construction of single deletion codes with additional check equations.
• Computer Science
IEEE Transactions on Information Theory
• 2022
This work gives an explicit construction of a family of error correcting codes for the binary deletion channel and for the Poisson repeat channel that have polynomial time encoding and decoding algorithms.
• Computer Science
IEEE Transactions on Information Theory
• 2017
The first efficient constructions which meet the qualitative goals of correcting a deletion fraction approaching 1 over bounded alphabets, and correcting a constant fraction of bit deletions with rate approach 1 over a fixed alphabet are given.
• Computer Science
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
• 2022
It is proved that there exists an absolute constant 6 > 0 such any binary code tolerating (1/2 - δ) N tolerating adversarial deletions must satisfy C ≤ 2<sup>polylog</sup><tex>$N$</tex> and thus have rate asymptotically approaching 0.
• Computer Science
SODA
• 2021
This paper disprove the existence of binary linear codes of length $n$ and rate just below $1/2$ capable of correcting $\Omega(n)$ insertions and deletions and shows that the $\frac{1}{2}$-rate limitation does not hold for affine codes by giving an explicit affine code of rate $1-\epsilon$ which can efficiently correct a constant fraction of insdel errors.
• Computer Science
STOC
• 2017
This paper focuses on designing insdel codes, i.e., error correcting block codes (ECCs) for insertion deletion channels, and introduces synchronization strings, which provide a novel way of efficiently dealing with synchronization errors.
• Computer Science
IEEE Trans. Inf. Theory
• 2001
This work presents the first low-complexity algorithm for obtaining the generator matrix for AG codes on the curves of GS, and suggests that by concatenating the AG code with short binary block codes, it is possible to obtain binary codes with asymptotic performance close to the G-V bound.
• Computer Science
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018
This paper gives an efficient deterministic protocol with sketch size O(k log^2 n/k) and obtains the first explicit construction of binary insdel codes that has optimal redundancy for a wide range of error parameters k, and brings the understanding of binaryinsdel codes much closer to that of standard binary error correcting codes.
• Computer Science
IEEE Transactions on Information Theory
• 2021
The recent progress in designing efficient error-correcting codes over finite alphabets that can correct a constant fraction of worst-case insertions and deletions is surveyed.