Marker Codes Using the Decoding Based on Weighted Levenshtein Distance in the Presence of Insertions/Deletions

Abstract

A random marker code is inserted into the information sequences periodically, and a novel symbol-level decoding algorithm considering the weighted Levenshtein distance (WLD) is designed for correcting insertions, deletions, as well as substitutions in the received sequences. In this method, branch quantities in the decoding trellis are calculated by measuring the WLD, which is done using the dynamic programming. A simulation study is performed to demonstrate the effectiveness of the presented scheme in the practical system, especially for channels with weak synchronization problems.

Keywords

• Marker code
• weighted Levenshtein distance
• insertions/deletions
• synchronization