暂无分享,去创建一个
Bernhard Haeupler | Amirbehshad Shahrasbi | Ellen Vitercik | Bernhard Haeupler | Ellen Vitercik | Amirbehshad Shahrasbi
[1] Bernhard Haeupler,et al. Synchronization strings: explicit constructions, local decoding, and applications , 2017, STOC.
[2] David Zuckerman,et al. Asymptotically good codes correcting insertions, deletions, and transpositions , 1997, SODA '97.
[3] Mark Braverman,et al. Towards deterministic tree code constructions , 2012, ITCS '12.
[4] Venkatesan Guruswami,et al. Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[5] Ran Raz,et al. Interactive channel capacity , 2013, STOC '13.
[6] Ran Gelles,et al. Capacity of Interactive Communication over Erasure Channels and Channels with Feedback , 2015, SIAM J. Comput..
[7] Moni Naor,et al. Fast Algorithms for Interactive Coding , 2013, SODA.
[8] Rafail Ostrovsky,et al. Optimal Coding for Streaming Authentication and Interactive Communication , 2015, IEEE Transactions on Information Theory.
[9] Klim Efremenko,et al. Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback , 2016, IEEE Trans. Inf. Theory.
[10] Gilles Brassard,et al. Noisy Interactive Quantum Communication , 2019, SIAM J. Comput..
[11] Kuan Cheng,et al. Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets , 2017, ArXiv.
[12] Bernhard Haeupler,et al. Synchronization strings: codes for insertions and deletions approaching the Singleton bound , 2017, STOC.
[13] Madhu Sudan,et al. Synchronization Strings: List Decoding for Insertions and Deletions , 2018, ICALP.
[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] Yael Tauman Kalai,et al. Fast Interactive Coding against Adversarial Noise , 2014, JACM.
[16] Mark Braverman,et al. Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.
[17] Mark Braverman,et al. Coding for Interactive Communication Correcting Insertions and Deletions , 2017, IEEE Transactions on Information Theory.
[18] Amit Sahai,et al. Adaptive protocols for interactive communication , 2013, 2016 IEEE International Symposium on Information Theory (ISIT).
[19] Madhu Sudan,et al. Optimal error rates for interactive coding I: adaptivity and other settings , 2013, STOC.
[20] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.
[21] Amit Sahai,et al. Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[22] Yael Tauman Kalai,et al. Efficient Interactive Coding against Adversarial Noise , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[23] Leonard J. Schulman,et al. Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[24] Mark Braverman,et al. List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[25] 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.
[26] Bernhard Haeupler,et al. Interactive Channel Capacity Revisited , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[27] Venkatesan Guruswami,et al. Deletion Codes in the High-Noise and High-Rate Regimes , 2014, IEEE Transactions on Information Theory.
[28] Amit Sahai,et al. Efficient Coding for Interactive Communication , 2014, IEEE Transactions on Information Theory.
[29] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.