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

TL;DR

This paper introduces a new construction for run-length limited codes capable of correcting single insertion or deletion errors, with efficient encoding and decoding algorithms, enhancing synchronization error correction in data transmission.

Contribution

The paper presents a novel construction and encoding algorithm for maximum run-length limited single insertion/deletion correcting codes, with analysis of redundancy.

Findings

Efficient encoding and decoding algorithms developed.

Redundancy of the proposed codes analyzed.

Applicable to synchronization error correction in communication systems.

Abstract

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.