• Diese Seite als PDF öffnen.

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

Keywords:
Deletion Correction, Burst Correction, Nonbinary Codes

Description

DNA is a promising data storing medium due to its longetivity and high storage density. However, due to its biological nature data errors can occur when storing or reading the DNA sequences. Moreover, not only substitution erros but also insertion and deletion errors occur frequently in the storage process. Therefore, it is important to tackle these kind of errors via coding. [1] studies a method to uniquely correct burst of at most two deletions in a nonbinary sequences.

The student's task is to understand the coding theme used in [1], including the proposed decoding method.

For an introduction, the references [2] may help.

yle="margin-left: 32pt; text-indent: -32.0pt;">[1] S. Wang, J. Sima and F. Farnoud, "Non-binary Codes for Correcting a Burst of at Most 2 Deletions," 2021 IEEE International Symposium on Information Theory (ISIT), 2021, pp. 2804-2809, doi: 10.1109/ISIT45174.2021.9517917.[2] N. J. A. Sloane, “On Single-Deletion-Correcting Codes,” 2002.

yle="margin-left: 32pt; text-indent: -32.0pt;">[3]V. I. Levenshtein, “Binary Codes Capable of Correcting Deletions, Insertions, and Reversals.” Soviet Physics-Doklady, Moscow, 1966.

Supervisor:

• Diese Seite als PDF öffnen.

Criss-Cross Insertion and Deletion Correcting Codes

Description

In this project the coding problem for deletion/insertion of rows and columns in arrays is studied. Especially it is of interest to construct a code leveraging the 2-dimensional array structure which can correct any combination of row and colum deletion/insertions.

Supervisor: