Ohad Elishco

most citedBinary

t_{1}

-Deletion-

t_{2}

-Insertion-Burst Correcting Codes and Codes Correcting a Burst of Deletions

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.IT2022★ 1 cited

Binary $t_{1}$ -Deletion- $t_{2}$ -Insertion-Burst Correcting Codes and Codes Correcting a Burst of Deletions

Zuo Ye, Ohad Elishco

We first give a construction of binary $t_{1}$ -deletion- $t_{2}$ -insertion-burst correcting codes with redundancy at most $lo g (n) + (t_{1} - t_{2} - 1) lo g lo g (n) + O (1)$ , where $t_{1} \geq 2 t_{2}$ . The…

Binary t1​-Deletion-t2​-Insertion-Burst Correcting Codes and Codes Correcting a Burst of Deletions

Binary $t_{1}$ -Deletion- $t_{2}$ -Insertion-Burst Correcting Codes and Codes Correcting a Burst of Deletions