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.

中文翻译：

---

在存在插入/删除的情况下使用基于加权Levenshtein距离的解码的标记码

将随机标记码周期性地插入到信息序列中，并设计了一种考虑加权Levenshtein距离（WLD）的新型符号级解码算法，用于纠正接收序列中的插入、删除和替换。在这种方法中，解码网格中的分支量是通过测量 WLD 来计算的，这是使用动态规划完成的。进行仿真研究以证明所提出方案在实际系统中的有效性，特别是对于具有弱同步问题的信道。