Capacity Upper Bounds for Deletion-type Channels
暂无分享,去创建一个
[1] Khaled Abdel-Ghaffar. Capacity per unit cost of a discrete memoryless channel , 1993 .
[2] Venkatesan Guruswami,et al. Coding against deletions in oblivious and online models , 2018, SODA.
[3] Dario Fertonani,et al. Novel Bounds on the Capacity of the Binary Deletion Channel , 2010, IEEE Transactions on Information Theory.
[4] Michael Mitzenmacher,et al. A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.
[5] Mahdi Cheraghchi,et al. Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[6] Tolga M. Duman,et al. Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation , 2015, IEEE Transactions on Information Theory.
[7] A. Erdélyi,et al. Higher Transcendental Functions , 1954 .
[8] Qin Zhang,et al. Edit Distance: Sketching, Streaming, and Document Exchange , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[9] Adam Tauman Kalai,et al. Tight asymptotic bounds for the deletion channel with small deletion probabilities , 2010, 2010 IEEE International Symposium on Information Theory.
[10] Dmitrii Karp,et al. Completely Monotonic Gamma Ratio and Infinitely Divisible H-Function of Fox , 2015, 1501.05388.
[11] Venkatesan Guruswami,et al. List decoding subspace codes from insertions and deletions , 2012, ITCS '12.
[12] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[13] Michael Mitzenmacher,et al. A Simple Lower Bound for the Capacity of the Deletion Channel , 2006, IEEE Transactions on Information Theory.
[14] Alfonso Martinez,et al. Spectral efficiency of optical direct detection , 2007 .
[15] Mahdi Cheraghchi. Expressions for the Entropy of Binomial-Type Distributions , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[16] GergHo Nemes. More accurate approximations for the Gamma function , 2010 .
[17] Dario Fertonani,et al. Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions , 2011, IEEE Transactions on Communications.
[18] David Zuckerman,et al. Asymptotically good codes correcting insertions, deletions, and transpositions , 1997, SODA '97.
[19] Tsachy Weissman,et al. Mutual information, relative entropy, and estimation in the Poisson channel , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.
[20] Venkatesan Guruswami,et al. An Improved Bound on the Fraction of Correctable Deletions , 2015, IEEE Transactions on Information Theory.
[21] Cyrus Rashtchian,et al. Random access in large-scale DNA data storage , 2018, Nature Biotechnology.
[22] Venkatesan Guruswami,et al. Deletion Codes in the High-Noise and High-Rate Regimes , 2014, IEEE Transactions on Information Theory.
[23] Suhas N. Diggavi,et al. Capacity Upper Bounds for the Deletion Channel , 2007, 2007 IEEE International Symposium on Information Theory.
[24] Venkatesan Guruswami,et al. Efficient Low-Redundancy Codes for Correcting Multiple Deletions , 2015, IEEE Transactions on Information Theory.
[25] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[26] Mahdi Cheraghchi,et al. Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[27] S. Shamai,et al. Capacity of a pulse amplitude modulated direct detection photon channel , 1990 .
[28] Amos Lapidoth,et al. Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.
[29] Mahdi Cheraghchi. Capacity upper bounds for deletion-type channels , 2018, STOC.
[30] Marco Dalai. A new bound on the capacity of the binary deletion channel with high deletion probabilities , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[31] Florham Park,et al. On Transmission Over Deletion Channels , 2001 .
[32] G. Rw. Decision procedure for indefinite hypergeometric summation , 1978 .
[33] Suhas N. Diggavi,et al. On information transmission over a finite buffer channel , 2000, IEEE Transactions on Information Theory.
[34] Amos Lapidoth,et al. On the Capacity of the Discrete-Time Poisson Channel , 2009, IEEE Transactions on Information Theory.
[35] R. W. Gosper. Decision procedure for indefinite hypergeometric summation. , 1978, Proceedings of the National Academy of Sciences of the United States of America.
[36] Michael Mitzenmacher,et al. Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels , 2007, IEEE Transactions on Information Theory.
[37] Luis Ceze,et al. A DNA-Based Archival Storage System , 2016, ASPLOS.
[38] Rafail Ostrovsky,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..
[39] Lev B. Klebanov,et al. A Problem of Zolotarev and Analogs of Infinitely Divisible and Stable Distributions in a Scheme for Summing a Random Number of Random Variables , 1985 .
[40] Yashodhan Kanoria,et al. Optimal Coding for the Binary Deletion Channel With Small Deletion Probability , 2013, IEEE Transactions on Information Theory.