TL;DR
This paper develops new codes that efficiently correct bursts of deletions or insertions, closing the gap between theoretical lower bounds and existing code constructions, and extends the model to more general burst scenarios.
Contribution
It provides near-optimal code constructions for burst-deletion correction with minimized redundancy and extends the model to non-consecutive and size-limited deletion bursts.
Findings
Redundancy of the new codes is at most log(n)+(b-1)log(log(n))+b-log(b)
Extended models include at most b consecutive deletions and at most b deletions (not necessarily consecutive)
Equivalent insertion models are also studied and linked to burst deletion correction.
Abstract
This paper studies codes that correct bursts of deletions. Namely, a code will be called a -burst-deletion-correcting code if it can correct a deletion of any consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically , the redundancy of the best code construction by Cheng et al. is . In this paper we close on this gap and provide codes with redundancy at most . We also derive a non-asymptotic upper bound on the size of -burst-deletion-correcting codes and extend the burst deletion model to two more cases: 1) A deletion burst of at most consecutive bits and 2) A deletion burst of size at most (not necessarily consecutive). We extend our code construction for the first case and study the second case for . The equivalent models for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
