On the information rates of channels with insertion/deletion/substitution errors

In this work, we propose to use trellis structures to characterize channels with insertions, deletions and substitutions. We start with binary-input binary-output channels with either insertions or deletions, and develop a simulation based approach to estimate the corresponding information rates. This approach is then generalized to the case where there exist both insertions and deletions. We show that, the proposed algorithm is an efficient and flexible technique to closely estimate the information rates for channels with insertions, deletions and substitutions.