Correcting an ordered deletion-erasure

06/20/2018
by   Ghurumuruhan Ganesan, et al.
0

In this paper, we show that the single deletion correcting Varshamov-Tenengolts code, with minor modifications, can also correct an ordered deletion-erasure pattern where one deletion and at most one erasure occur and the deletion always occurs before the erasure. For large code lengths, the constructed code has the same logarithmic redundancy as optimal codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2019

Optimal k-Deletion Correcting Codes

Levenshtein introduced the problem of constructing k-deletion correcting...
research
01/12/2021

Listwise Deletion in High Dimensions

We consider the properties of listwise deletion when both n and the numb...
research
11/08/2021

Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution

Transmit a codeword x, that belongs to an (ℓ-1)-deletion-correcting code...
research
08/10/2022

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

We consider the problem of correcting insertion and deletion errors in t...
research
01/15/2020

Insertion-Deletion Transformer

We propose the Insertion-Deletion Transformer, a novel transformer-based...
research
12/28/2020

On deletion diagnostic statistic in regression

A brief review about choosing a normalizing or scaling matrix for deleti...
research
09/11/2018

On the aberrations of mixed level Orthogonal Arrays with removed runs

Given an Orthogonal Array we analyze the aberrations of the sub-fraction...

Please sign up or login with your details

Forgot password? Click here to reset