A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
New lower bounds are obtained for the capacity of a binary channel with deletions and insertions. Each input bit to the channel is deleted with probability d, or an extra bit is inserted after it with probability i, or it is transmitted unmodified with probability 1 − d − i. This paper builds on the idea introduced in  of using a sub-optimal decoder that decodes the positions of the deleted and inserted runs, in addition to the transmitted codeword. The mutual information between the channeldoi:10.1109/itw.2013.6691342 dblp:conf/itw/VenkataramananT13a fatcat:vmgeyiez7nethfpeos66clqiau