Multiple Criss-Cross Deletion-Correcting Codes

by   Lorenz Welter, et al.

This paper investigates the problem of correcting multiple criss-cross deletions in arrays. More precisely, we study the unique recovery of n × n arrays affected by any combination of t_r row and t_c column deletions such that t_r + t_c = t for a given t. We refer to these type of deletions as t-criss-cross deletions. We show that a code capable of correcting t-criss-cross deletions has redundancy at least tn + t log n - log(t!). Then, we present an existential construction of a code capable of correcting t-criss-cross deletions where its redundancy is bounded from above by tn + 𝒪(t^2 log^2 n). The main ingredients of the presented code are systematic binary t-deletion correcting codes and Gabidulin codes. The first ingredient helps locating the indices of the deleted rows and columns, thus transforming the deletion-correction problem into an erasure-correction problem which is then solved using the second ingredient.


page 1

page 2

page 3

page 4


Criss-Cross Deletion Correcting Codes

This paper studies the problem of constructing codes correcting deletion...

Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays

We consider the problem of correcting insertion and deletion errors in t...

Systematic Single-Deletion Multiple-Substitution Correcting Codes

Although studying in multiple-deletion correcting codes has made great p...

Correcting an ordered deletion-erasure

In this paper, we show that the single deletion correcting Varshamov-Ten...

Explicit two-deletion codes with redundancy matching the existential bound

We give an explicit construction of length-n binary codes capable of cor...

Optimal Codes Correcting a Burst of Deletions of Variable Length

In this paper, we present an efficiently encodable and decodable code co...

Two Deletion Correcting Codes from Indicator Vectors

Construction of capacity achieving deletion correcting codes has been a ...