AI Chat AI Image Generator AI Video Text to Speech

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

12/25/2020

∙

by Reona Takemoto, et al.

∙

∙

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.

Reona Takemoto
1 publication
Takayuki Nozaki
8 publications

page 1

page 2

page 3

page 4

research

∙ 10/25/2022

Non-binary Two-Deletion Correcting Codes and Burst-Deletion Correcting Codes

In this paper, we construct systematic q-ary two-deletion correcting cod...

0 Wentu Song, et al. ∙

research

∙ 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...

0 Shu Liu, et al. ∙

research

∙ 08/15/2023

Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions

Encoding data as a set of unordered strings is receiving great attention...

0 Jin Sima, et al. ∙

research

∙ 07/17/2020

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

This paper studies linear and affine error-correcting codes for correcti...

0 Kuan Cheng, et al. ∙

research

∙ 07/18/2022

Correcting k Deletions and Insertions in Racetrack Memory

One of the main challenges in developing racetrack memory systems is the...

0 Jin Sima, et al. ∙

research

∙ 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 ...

0 Hokuto Takahashi, et al. ∙

research

∙ 09/23/2022

Logarithmically larger deletion codes of all distances

The deletion distance between two binary words u,v ∈{0,1}^n is the small...

0 Noga Alon, et al. ∙