Coding for Interactive Communication Correcting Insertions and Deletions
暂无分享,去创建一个
[1] Ran Gelles,et al. Capacity of Interactive Communication over Erasure Channels and Channels with Feedback , 2015, SIAM J. Comput..
[2] Leonard J. Schulman,et al. Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[3] Mark Braverman,et al. Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.
[4] Mark Braverman,et al. Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.
[5] Amit Sahai,et al. Adaptive protocols for interactive communication , 2013, 2016 IEEE International Symposium on Information Theory (ISIT).
[6] Klim Efremenko,et al. Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback , 2015, IEEE Transactions on Information Theory.
[7] Yael Tauman Kalai,et al. Fast Interactive Coding against Adversarial Noise , 2014, JACM.
[8] Amit Sahai,et al. Efficient Coding for Interactive Communication , 2014, IEEE Transactions on Information Theory.
[9] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.
[10] V. Guruswami,et al. Efficient low-redundancy codes for correcting multiple deletions , 2016, SODA 2016.
[11] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[12] Kannan Ramchandran,et al. Low-Complexity Interactive Algorithms for Synchronization From Deletions, Insertions, and Substitutions , 2013, IEEE Transactions on Information Theory.
[13] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.
[14] Alexander A. Sherstov,et al. Optimal Interactive Coding for Insertions, Deletions, and Substitutions , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[15] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[16] Bernhard Haeupler,et al. Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[17] Mark Braverman,et al. Coding for Interactive Communication Correcting Insertions and Deletions , 2017, IEEE Transactions on Information Theory.
[18] Yael Tauman Kalai,et al. Efficient Interactive Coding against Adversarial Noise , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[19] Ran Gelles,et al. Coding for Interactive Communication: A Survey , 2017, Found. Trends Theor. Comput. Sci..
[20] David Zuckerman,et al. Asymptotically good codes correcting insertions, deletions, and transpositions , 1997, SODA '97.
[21] Ran Raz,et al. Interactive channel capacity , 2013, STOC '13.
[22] Amit Sahai,et al. Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[23] Bernhard Haeupler,et al. Interactive Channel Capacity Revisited , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[24] Venkatesan Guruswami,et al. Deletion Codes in the High-noise and High-rate Regimes , 2015, APPROX-RANDOM.
[25] Moni Naor,et al. Fast Algorithms for Interactive Coding , 2013, SODA.
[26] Rafail Ostrovsky,et al. Optimal Coding for Streaming Authentication and Interactive Communication , 2015, IEEE Transactions on Information Theory.
[27] Madhu Sudan,et al. Optimal error rates for interactive coding I: adaptivity and other settings , 2013, STOC.
[28] Venkatesan Guruswami,et al. An Improved Bound on the Fraction of Correctable Deletions , 2015, IEEE Transactions on Information Theory.
[29] Mark Braverman,et al. List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise , 2014, FOCS.
[30] Gilles Brassard,et al. Noisy Interactive Quantum Communication , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.