LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

Photo by kellysikkema from unsplash

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… Click to show full 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: codes using; marker codes; levenshtein distance; insertions deletions; weighted levenshtein

Journal Title: IEEE Access
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.