Achievable rates for channels with deletions and insertions
Achievable rates for channels with deletions and insertions
Consider a binary channel with deletions and insertions, where each input bit is transformed in one of the following ways: it is deleted with probability d, or an extra bit added after it with probability i, or it is transmitted unmodified with probability 1 - d - i. We obtain …