Trace reconstruction with constant deletion probability and related results
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Upper bounding the deletion channel capacity by auxiliary memoryless channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Communications
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
IEEE Transactions on Information Theory
Novel bounds on the capacity of the binary deletion channel
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
This paper considers the capacity of binary deletion channels, where bits are deleted independently with probability d. It improves significantly upon the best previous framework used to obtain provable lower bounds on this capacity by utilizing a stronger definition of a typical output from the channel. The new results give the best known provable bounds on the capacity for all values of d. Moreover, the techniques presented here extend to yield lower bounds for channels with certain types of random insertions, namely, duplications, or combinations of duplications and deletions. To demonstrate these techniques in this context, two binary channels are analyzed: a channel where each transmitted bit is copied with probability nu and a channel where each transmitted bit is copied a geometrically distributed number of times.