暂无分享,去创建一个
[1] Khaled A. S. Abdel-Ghaffar,et al. On Linear and Cyclic Codes for Correcting Deletions , 2007, 2007 IEEE International Symposium on Information Theory.
[2] Bernhard Haeupler,et al. Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions , 2017, ICALP.
[3] Antonia Wachter-Zeh,et al. List Decoding of Insertions and Deletions , 2017, IEEE Transactions on Information Theory.
[4] Kuan Cheng,et al. Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets , 2017, ArXiv.
[5] Bernhard Haeupler. Optimal Document Exchange and New Codes for Insertions and Deletions , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[6] Jehoshua Bruck,et al. Optimal k-Deletion Correcting Codes , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).
[7] Bernhard Haeupler,et al. Synchronization strings: codes for insertions and deletions approaching the Singleton bound , 2017, STOC.
[8] Madhu Sudan,et al. Synchronization Strings: List Decoding for Insertions and Deletions , 2018, ICALP.
[9] Bernhard Haeupler,et al. Synchronization strings: explicit constructions, local decoding, and applications , 2017, STOC.
[10] Venkatesan Guruswami,et al. An Improved Bound on the Fraction of Correctable Deletions , 2015, IEEE Transactions on Information Theory.
[11] Bernhard Haeupler,et al. Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing , 2018, STOC.
[12] Zhengzhong Jin,et al. Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[13] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[14] Zhengzhong Jin,et al. Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes , 2018, ICALP.
[15] Venkatesan Guruswami,et al. Efficient Low-Redundancy Codes for Correcting Multiple Deletions , 2015, IEEE Transactions on Information Theory.
[16] Noga Alon,et al. Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[17] Kenji Yasunaga,et al. On the List Decodability of Insertions and Deletions , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[18] Venkatesan Guruswami,et al. Optimally resilient codes for list-decoding from insertions and deletions , 2019, Electron. Colloquium Comput. Complex..
[19] Kenneth W. Shum,et al. A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound , 2001, IEEE Trans. Inf. Theory.
[20] Venkatesan Guruswami,et al. Deletion Codes in the High-Noise and High-Rate Regimes , 2014, IEEE Transactions on Information Theory.
[21] David Zuckerman,et al. Asymptotically good codes correcting insertions, deletions, and transpositions , 1997, SODA '97.