Construction and Encoding Algorithm for Maximum Run-Length Limited Single Insertion/Deletion Correcting Code

12/25/2020
by   Reona Takemoto, et al.
0

Maximum run-length limited codes are constraint codes used in communication and data storage systems. Insertion/deletion correcting codes correct insertion or deletion errors caused in transmitted sequences and are used for combating synchronization errors. This paper investigates the maximum run-length limited single insertion/deletion correcting (RLL-SIDC) codes. More precisely, we construct efficiently encodable and decodable RLL-SIDC codes. Moreover, we present its encoding algorithm and show the redundancy of the code.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/27/2019

Optimal k-Deletion Correcting Codes

Levenshtein introduced the problem of constructing k-deletion correcting...
09/08/2019

Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime

Insertion and deletion (insdel for short) errors are synchronization err...
07/17/2020

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

This paper studies linear and affine error-correcting codes for correcti...
09/12/2019

Repeat-Free Codes

In this paper we consider the problem of encoding data into repeat-free ...
04/15/2020

Decoding algorithms of monotone codes and azinv codes and their unified view

This paper investigates linear-time decoding algorithms for two classes ...
05/20/2019

Coding for Deletion Channels with Multiple Traces

Motivated by the sequence reconstruction problem from traces in DNA-base...
02/04/2021

Multiple Criss-Cross Deletion-Correcting Codes

This paper investigates the problem of correcting multiple criss-cross d...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.