A maximum a posteriori decoder is given for convolutional codes when transmitted over a
binary random error channel that exhibits insertion, deletion and substitution errors. It is …

Sequential decoding, commonly applied to substitution channels, is a sub-optimal
alternative to Viterbi decoding with significantly reduced memory costs. This work describes …

In this work, a sequential decoder for convolutional codes over channels that are vulnerable
to insertion, deletion, and substitution errors, is described and analyzed. The decoder …

This paper studies optimal decoding for a special case of the deletion channel, referred by
the t-deletion channel, which deletes exactly t symbols of the transmitted word uniformly at …

Standard decoding approaches for convolutional codes, such as the Viterbi and BCJR
algorithms, entail significant complexity when correcting synchronization errors. The …

This paper tackles two problems that are relevant to coding for insertions and deletions.
These problems are motivated by several applications, among them is reconstructing …

Minimum distance (MD), maximum likelihood (ML), and maximum a posteriori (MAP)
decoding is considered for synchronization error correcting (SEC) codes with known …

A concatenated code with designed markers is proposed to detect and correct both
synchronization and substitution errors. The inner decoder is effective in maintaining …

This paper studies the error probability of maximum-likelihood (ML) decoding for a special
case of the deletion channel, referred by the t-deletion channel, which deletes exactly t …

Time-Varying Variable-Length Error-Correcting (TV-VLEC) codes for joint source-channel
coding are introduced. These are codes that use different codebooks according to the …