A Survey of Results for Deletion Channels and Related Synchronization Channels
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Novel bounds on the capacity of binary channels with deletions and substitutions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Small-sample distribution estimation over sticky channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Novel bounds on the capacity of the binary deletion channel
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight numerical upper and lower bounds for the independent and identically distributed (i.i.d.) duplication channel.