Related references
Note: Only part of the references are listed.Two Deletion Correcting Codes From Indicator Vectors
Jin Sima et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2020)
Guess & Check Codes for Deletions, Insertions, and Synchronization
Serge Kas Hanna et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2019)
Codes Correcting Two Deletions
Ryan Gabrys et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2019)
Optimal Document Exchange and New Codes for Insertions and Deletions
Bernhard Haeupler
2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019) (2019)
Efficient Low-Redundancy Codes for Correcting Multiple Deletions
Joshua Brakensiek et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2018)
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors
Kuan Cheng et al.
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2018)
Deletion Codes in the High-Noise and High-Rate Regimes
Venkatesan Guruswami et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2017)
On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction
Khaled A. S. Abdel-Ghaffar et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2012)
A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences
Filip Paluncic et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2012)
On multiple insertion/deletion correcting codes
ASJ Helberg et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2002)
Share Paper
