Non-binary Codes for Correcting a Burst of at Most t Deletions

10/21/2022
by   Shuche Wang, et al.
0

The problem of correcting deletions has received significant attention, partly because of the prevalence of these errors in DNA data storage. In this paper, we study the problem of correcting a consecutive burst of at most t deletions in non-binary sequences. We first propose a non-binary code correcting a burst of at most 2 deletions for q-ary alphabets. Afterwards, we extend this result to the case where the length of the burst can be at most t where t is a constant. Finally, we consider the setup where the sequences that are transmitted are permutations. The proposed codes are the largest known for their respective parameter regimes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/21/2022

Binary t_1-Deletion-t_2-Insertion-Burst Correcting Codes and Codes Correcting a Burst of Deletions

We first give a construction of binary t_1-deletion-t_2-insertion-burst ...
research
01/15/2018

Coding over Sets for DNA Storage

In this paper we study error-correcting codes for the storage of data in...
research
04/29/2018

Construction and redundancy of codes for correcting deletable errors

Consider a binary word being transmitted through a communication channel...
research
01/05/2022

Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors

Motivated by applications to DNA-storage, flash memory, and magnetic rec...
research
08/18/2020

Error-correcting Codes for Noisy Duplication Channels

Because of its high data density and longevity, DNA is emerging as a pro...
research
02/23/2020

Efficient Compression of Long Arbitrary Sequences with No Reference at the Encoder

In a distributed information application an encoder compresses an arbitr...
research
06/19/2013

Verifying the Steane code with Quantomatic

In this paper we give a partially mechanized proof of the correctness of...

Please sign up or login with your details

Forgot password? Click here to reset