Criss-Cross Deletion Correcting Codes

by   Rawad Bitar, et al.

This paper studies the problem of constructing codes correcting deletions in arrays. Under this model, it is assumed that an n× n array can experience deletions of rows and columns. These deletion errors are referred to as (t_r,t_c)-criss-cross deletions if t_r rows and t_c columns are deleted, while a code correcting these deletion patterns is called a (t_r,t_c)-criss-cross deletion correction code. The definitions for criss-cross insertions are similar. Similar to the one-dimensional case, it is first shown that when t_r=t_c the problems of correcting criss-cross deletions and criss-cross insertions are equivalent. Then, we mostly investigate the case of (1,1)-criss-cross deletions. An asymptotic upper bound on the cardinality of (1,1)-criss-cross deletion correction codes is shown which assures that the asymptotic redundancy is at least 2n-1+2log n bits. Finally, a code construction with an explicit decoding algorithm is presented. The redundancy of the construction is away from the lower bound by at most 2 log n+8+2log e bits.


page 1

page 2

page 3

page 4


Multiple Criss-Cross Deletion-Correcting Codes

This paper investigates the problem of correcting multiple criss-cross d...

Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size

This paper studies on the cardinality of perfect multi deletion binary c...

Systematic Single-Deletion Multiple-Substitution Correcting Codes

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

Improved Asymptotic Bounds for Codes Correcting Insertions and Deletions

This paper studies the cardinality of codes correcting insertions and de...

Non-binary Code Correcting Single b-Burst of Insertions or Deletions

This paper constructs a non-binary code correcting a single b-burst of i...

Two Deletion Correcting Codes from Indicator Vectors

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

Explicit two-deletion codes with redundancy matching the existential bound

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