Optimal Codes Correcting Localized Deletions

by   Rawad Bitar, et al.

We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most k deletions occur in a window of size k, where the positions of the deletions within this window are not necessarily consecutive. Localized deletions are thus a generalization of burst deletions that occur in consecutive positions. We present novel explicit codes that are efficiently encodable and decodable and can correct up to k localized deletions. Furthermore, these codes have log n+π’ͺ(k log^2 (klog n)) redundancy, where n is the length of the information message, which is asymptotically optimal in n for k=o(log n/(loglog n)^2).


page 1

page 2

page 3

page 4

βˆ™ 01/25/2022

t-Deletion-1-Insertion-Burst Correcting Codes

Motivated by applications in DNA-based storage and communication systems...
βˆ™ 01/18/2020

Optimal Codes Correcting a Burst of Deletions of Variable Length

In this paper, we present an efficiently encodable and decodable code co...
βˆ™ 12/19/2017

Codes Correcting Two Deletions

In this work, we investigate the problem of constructing codes capable o...
βˆ™ 07/18/2022

Correcting k Deletions and Insertions in Racetrack Memory

One of the main challenges in developing racetrack memory systems is the...
βˆ™ 01/07/2019

Locally Repairable Convolutional Codes with Sliding Window Repair

Locally repairable convolutional codes (LRCCs) for distributed storage s...
βˆ™ 01/16/2022

Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions

In this work, we study linear error-correcting codes against adversarial...
βˆ™ 04/09/2018

Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions

The recent line of study on randomness extractors has been a great succe...