Tight asymptotic bounds for the deletion channel with small deletion probabilities
暂无分享,去创建一个
[1] R. Gallager. SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS , 1961 .
[2] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[3] Suhas N. Diggavi,et al. On information transmission over a finite buffer channel , 2000, IEEE Transactions on Information Theory.
[4] Michael Mitzenmacher,et al. A Simple Lower Bound for the Capacity of the Deletion Channel , 2006, IEEE Transactions on Information Theory.
[5] Suhas N. Diggavi,et al. Capacity Upper Bounds for the Deletion Channel , 2007, 2007 IEEE International Symposium on Information Theory.
[6] Michael Mitzenmacher,et al. A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.
[7] Dario Fertonani,et al. Novel bounds on the capacity of binary channels with deletions and substitutions , 2009, 2009 IEEE International Symposium on Information Theory.
[8] Yashodhan Kanoria,et al. On the deletion channel with small deletion probability , 2009, 2010 IEEE International Symposium on Information Theory.