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

Autor:	Wang, Shuche, Tang, Yuanyuan, Sima, Jin, Gabrys, Ryan, Farnoud, Farzad
Rok vydání:	2022
Předmět:	Computer Science - Information Theory
Druh dokumentu:	Working Paper
Popis:	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. Comment: 20 pages. The paper has been submitted to IEEE Transactions on Information Theory. Furthermore, the paper was presented in part at the ISIT2021 and Allerton2022
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2210.11818 Zobrazit plný text záznamu View this record from Arxiv