DocumentCode
3123026
Title
Mutual information for a deletion channel
Author
Drmota, Michael ; Szpankowski, Wojciech ; Viswanathan, Krishnamurthy
Author_Institution
Tech. Univ. Wien, Vienna, Austria
fYear
2012
fDate
1-6 July 2012
Firstpage
2561
Lastpage
2565
Abstract
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.
Keywords
binary sequences; channel capacity; probability; binary deletion channel; conditional probability distribution; deletion channel capacity; hidden pattern matching problem; mutual information; Capacity planning; Channel capacity; Entropy; Mutual information; Pattern matching; Probability distribution; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location
Cambridge, MA
ISSN
2157-8095
Print_ISBN
978-1-4673-2580-6
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2012.6283980
Filename
6283980
Link To Document