Capacity Upper Bounds for the Deletion Channel
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. On the capabilities of codes to correct synchronization errors , 1967, IEEE Trans. Inf. Theory.
[2] Khaled Abdel-Ghaffar. Capacity per unit cost of a discrete memoryless channel , 1993 .
[3] Michael Mitzenmacher,et al. On Lower Bounds for the Capacity of Deletion Channels , 2006, IEEE Transactions on Information Theory.
[4] Michael Mitzenmacher,et al. Capacity Bounds for Sticky Channels , 2008, IEEE Transactions on Information Theory.
[5] Michael Mitzenmacher,et al. A Simple Lower Bound for the Capacity of the Deletion Channel , 2006, IEEE Transactions on Information Theory.
[6] R. Gallager. Information Theory and Reliable Communication , 1968 .
[7] Florham Park,et al. On Transmission Over Deletion Channels , 2001 .
[8] Michael Mitzenmacher,et al. Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels , 2007, IEEE Transactions on Information Theory.
[9] Aleksandar Kavcic,et al. Insertion/deletion channels: reduced-state lower bounds on channel capacities , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[10] Suhas N. Diggavi,et al. On information transmission over a finite buffer channel , 2000, IEEE Transactions on Information Theory.
[11] S.N. Diggavi,et al. Information transmission over a finite buffer channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[12] N.J.A. Sloane,et al. On Single-Deletion-Correcting Codes , 2002, math/0207197.
[13] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[14] R. Gallager. SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS , 1961 .