Synchronization Strings and Codes for Insertions and Deletions—A Survey

@article{Haeupler2021SynchronizationSA,
  title={Synchronization Strings and Codes for Insertions and Deletions—A Survey},
  author={Bernhard Haeupler and Amirbehshad Shahrasbi},
  journal={IEEE Transactions on Information Theory},
  year={2021},
  volume={67},
  pages={3190-3206}
}
Already in the 1960s, Levenshtein and others studied error-correcting codes that protect against synchronization errors, such as symbol insertions and deletions. However, despite significant efforts, progress on designing such codes has been lagging until recently, particularly compared to the detailed understanding of error-correcting codes for symbol substitution or erasure errors. This paper surveys the recent progress in designing efficient error-correcting codes over finite alphabets that… 

Figures from this paper

Bounds and Constructions for Insertion and Deletion Codes
TLDR
The present paper mainly studies limits and constructions of insdel codes, and provides a non-explicit construction of nonlinear codes that can approach the insdel-metric Singleton bound arbitrarily when the code alphabet size is sufficiently large.
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
TLDR
New, strong lower bounds for the existence of Insdel LDCs are proved, and it is shown that 2-query linear InsdelLDCs do not exist, and an exponential lower bound for the length of all q-query InsdellDCs with constant q is given.
A concatenated LDPC-marker code for channels with correlated insertion and deletion errors in bit-patterned media recording system
TLDR
A probabilistic channel model with correlated insertion and deletion (CID) errors to capture the data dependence applicable to the bit-patterned media recording (BPMR) system is proposed and the error performance and decoding complexity of a concatenated LDPC-marker code over the CID channel is investigated.
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes
TLDR
This paper proposes a strict half-Singleton upper bound dI(C) ≤ 2(n−2k+1) if C does not contain the codeword with all 1s, and a stronger direct upper bound under a weak condition, and shows that the code length of optimal binary linear insdel codes with respect to the (strict) half- Singleton bound is about twice the dimension.
Strong Singleton type upper bounds for linear insertion-deletion codes
TLDR
Some new Singleton type upper bounds for the insertion-deletion distances for linear codes over Fq, which are much stronger than the previous bounds are given, which implies that asymptotically when the lengths goes to the infinity and the information rate is bigger than or equal to 1 2 then relative insdel distances go to the zero.
Synchronization Error-Correction Coding Based on Probabilistic Inference and Sparse Matrices
  • Ryo Shibata
  • Computer Science
    IEICE ESS Fundamentals Review
  • 2022
TLDR
This article presents a probabilistic channel model of synchronization errors, formalize a decoding problem for the channel as probabilism inference, and shows a belief-propagation decoding algorithm based on sparse matrices.
Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels
TLDR
It is shown that for any oblivious synchronization channel whose output length follows a sub-exponential distribution either mean-based trace reconstruction is impossible or traces suffice for this task.
Rate-Distance Tradeoffs for List-Decodable Insertion-Deletion Codes
TLDR
Novel outer and inner bounds for the highest achievable communication rate of any insertion-deletion code that can be list-decoded from any $\gamma$ fraction of insertions and any $\delta $ fraction of deletions are given.
Reed Solomon Codes Against Adversarial Insertions and Deletions
TLDR
It is proved that over fields of size nO(k) there are [n, k] Reed-Solomon codes that can decode from n – 2k + 1 insdel errors and hence attain the half-Singleton bound and a deterministic construction of such codes over much larger fields is given.
Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions
TLDR
These results significantly improve linear error-correcting codes against adversarial insertion-deletion (insdel) errors and get much closer to the half-Singleton bound over small fields.
...
...

References

SHOWING 1-10 OF 67 REFERENCES
Synchronization strings: codes for insertions and deletions approaching the Singleton bound
TLDR
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.
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
TLDR
It is shown how to hide the complications of synchronization errors in many applications by introducing very general channel simulations which efficiently transform an insertion-deletion channel into a regular symbol corruption channel with an error rate larger by a constant factor and a slightly smaller alphabet.
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets
TLDR
The extremal question of the smallest possible alphabet size over which synchronization strings can exist for some constant e < 1 is studied, and it is shown that one can construct e-synchronization strings over alphabets of size four while no such string exists over binary alphABets.
On List Decoding of Insertion and Deletion Errors
TLDR
An upper bound on the list decoding radius of an insdel code in terms of its rate is provided and a Zyablov-type bound for insdel errors is obtained and a family of explicit insdel codes is constructed with efficient list decoding algorithm.
List Decoding of Insertion and Deletion Codes
TLDR
An upper bound on the list decoding radius of an insdel code in terms of its rate is provided and a Zyablov-type bound for insdel errors is obtained and a family of explicit insdel codes is constructed with efficient list decoding algorithm.
Efficient Linear and Affine Codes for Correcting Insertions/Deletions
TLDR
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.
Synchronization Strings: List Decoding for Insertions and Deletions
We study codes that are list-decodable under insertions and deletions. Specifically, we consider the setting where a codeword over some finite alphabet of size $q$ may suffer from $\delta$ fraction
Insertion/deletion correction with spectral nulls
TLDR
Some coding schemes and spectral shaping markers are presented which alleviate the fundamental restriction on Levenshtein's codes that the boundaries of each codeword should be known before insertion/deletion correction can be effected.
Synchronization strings: explicit constructions, local decoding, and applications
TLDR
It is shown that local decodability implies that error correcting codes constructed with long-distance synchronization strings can not only efficiently recover from δ fraction of insdel errors but, similar to [Schulman, Zuckerman; TransInf’99], also from any O(δ / logn) fraction of block transpositions and block replications.
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors
TLDR
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.
...
...