A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mutual information for a deletion channel
2012
2012 IEEE International Symposium on Information Theory Proceedings
Preserved Fulltext
We study the binary deletion channel where each input bit is independently deleted according to a fixed probability. We relate the conditional probability distribution of the output of the deletion channel given the input to the hidden pattern matching problem. This yields a new characterization of the mutual information between the input and output of the deletion channel. Through this characterization we are able to comment on the the deletion channel capacity, in particular for deletion probabilities approaching 0 and 1.
doi:10.1109/isit.2012.6283980
dblp:conf/isit/DrmotaSV12
fatcat:y2wi2pmfcvc57o67celmfizn54