Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions

Gabrys, Ryan; Guruswami, Venkatesan; Ribeiro, Joao; Wu, Ke

doi:10.1109/tit.2022.3202856

Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions

Journal Article · 01 January 2023 · IEEE Transactions on Information Theory

DOI:https://doi.org/10.1109/tit.2022.3202856· OSTI ID:2424808

^[1]; ^[2]; ^[3]; Wu, Ke ^[3]

Department of Electrical and Computer Engineering, University of California, La Jolla, San Diego, CA, USA
Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA, USA
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA

Not provided.

Research Organization:: National Energy Technology Laboratory (NETL), Pittsburgh, PA, Morgantown, WV (United States)

Sponsoring Organization:: USDOE

OSTI ID:: 2424808

Journal Information:: IEEE Transactions on Information Theory, Journal Name: IEEE Transactions on Information Theory Journal Issue: 1 Vol. 69; ISSN 0018-9448

Publisher:: IEEE

Country of Publication:: United States

Language:: English

References (25)

Optimal Codes Correcting a Burst of Deletions of Variable Length Lenz, Andreas; Polyanskii, Nikita 2020 IEEE International Symposium on Information Theory (ISIT) https://doi.org/10.1109/ISIT44484.2020.9174288	conference	June 2020
List Decoding of Insertions and Deletions Wachter-Zeh, Antonia IEEE Transactions on Information Theory, Vol. 64, Issue 9 https://doi.org/10.1109/TIT.2017.2777471	journal	September 2018
Reliable communication over channels with insertions, deletions, and substitutions Davey, M. C.; Mackay, D. J. C. IEEE Transactions on Information Theory, Vol. 47, Issue 2 https://doi.org/10.1109/18.910582	journal	January 2001
Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound Guruswami, Venkatesan; Hastad, Johan IEEE Transactions on Information Theory, Vol. 67, Issue 10 https://doi.org/10.1109/TIT.2021.3069446	journal	October 2021
Optimally resilient codes for list-decoding from insertions and deletions Guruswami, Venkatesan; Haeupler, Bernhard; Shahrasbi, Amirbehshad Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing https://doi.org/10.1145/3357713.3384262	conference	June 2020
Nonbinary codes, correcting single deletion or insertion (Corresp.) Tenengolts, G. IEEE Transactions on Information Theory, Vol. 30, Issue 5 https://doi.org/10.1109/TIT.1984.1056962	journal	September 1984
Optimal Document Exchange and New Codes for Insertions and Deletions Haeupler, Bernhard 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) https://doi.org/10.1109/FOCS.2019.00029	conference	November 2019
Portable and Error-Free DNA-Based Data Storage Yazdi, S. M. Hossein Tabatabaei; Gabrys, Ryan; Milenkovic, Olgica Scientific Reports, Vol. 7, Issue 1 https://doi.org/10.1038/s41598-017-05188-1	journal	July 2017
Synchronization strings: explicit constructions, local decoding, and applications Haeupler, Bernhard; Shahrasbi, Amirbehshad Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing https://doi.org/10.1145/3188745.3188940	conference	June 2018
Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality Cai, Kui; Chee, Yeow Meng; Gabrys, Ryan IEEE Transactions on Information Theory, Vol. 67, Issue 6 https://doi.org/10.1109/TIT.2021.3049627	journal	June 2021
Codes correcting a single insertion/deletion of a zero or a single peak-shift Klove, T. IEEE Transactions on Information Theory, Vol. 41, Issue 1 https://doi.org/10.1109/18.370100	journal	January 1995
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors Cheng, Kuan; Jin, Zhengzhong; Li, Xin 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) https://doi.org/10.1109/FOCS.2018.00028	conference	October 2018
Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction Gabrys, Ryan; Yaakobi, Eitan; Milenkovic, Olgica IEEE Transactions on Information Theory, Vol. 64, Issue 4 https://doi.org/10.1109/TIT.2017.2778143	journal	April 2018
An Overview of Capacity Results for Synchronization Channels Cheraghchi, Mahdi; Ribeiro, Joao IEEE Transactions on Information Theory, Vol. 67, Issue 6 https://doi.org/10.1109/TIT.2020.2997329	journal	June 2021
Codes Correcting a Burst of Deletions or Insertions Schoeny, Clayton; Wachter-Zeh, Antonia; Gabrys, Ryan IEEE Transactions on Information Theory, Vol. 63, Issue 4 https://doi.org/10.1109/TIT.2017.2661747	journal	April 2017
Single-Deletion Single-Substitution Correcting Codes Smagloy, Ilia; Welter, Lorenz; Wachter-Zeh, Antonia 2020 IEEE International Symposium on Information Theory (ISIT) https://doi.org/10.1109/ISIT44484.2020.9174213	conference	June 2020
Error-Correcting Codes for Short Tandem Duplication and Edit Errors Tang, Yuanyuan; Farnoud, Farzad IEEE Transactions on Information Theory, Vol. 68, Issue 2 https://doi.org/10.1109/TIT.2021.3125724	journal	February 2022
Random access in large-scale DNA data storage Organick, Lee; Ang, Siena Dumas; Chen, Yuan-Jyue Nature Biotechnology, Vol. 36, Issue 3 https://doi.org/10.1038/nbt.4079	journal	February 2018
Asymptotically good codes correcting insertions, deletions, and transpositions Schulman, L. J.; Zuckerman, D. IEEE Transactions on Information Theory, Vol. 45, Issue 7 https://doi.org/10.1109/18.796406	journal	January 1999
Efficient Low-Redundancy Codes for Correcting Multiple Deletions Brakensiek, Joshua; Guruswami, Venkatesan; Zbarsky, Samuel IEEE Transactions on Information Theory, Vol. 64, Issue 5 https://doi.org/10.1109/TIT.2017.2746566	journal	May 2018
Codes Correcting Two Deletions Gabrys, Ryan; Sala, Frederic IEEE Transactions on Information Theory, Vol. 65, Issue 2 https://doi.org/10.1109/TIT.2018.2876281	journal	February 2019
Non-binary Codes for Correcting a Burst of at Most 2 Deletions Wang, Shuche; Sima, Jin; Farnoud, Farzad 2021 IEEE International Symposium on Information Theory (ISIT) https://doi.org/10.1109/ISIT45174.2021.9517917	conference	July 2021
On Multiple-Deletion Multiple-Substitution Correcting Codes Song, Wentu; Polyanskii, Nikita; Cai, Kui 2021 IEEE International Symposium on Information Theory (ISIT) https://doi.org/10.1109/ISIT45174.2021.9517878	conference	July 2021
List-decodable Codes for Single-deletion Single-substitution with List-size Two Song, Wentu; Cai, Kui; Nguyen, Tuan Thanh 2022 IEEE International Symposium on Information Theory (ISIT) https://doi.org/10.1109/ISIT50566.2022.9834565	conference	June 2022
On Optimal k-Deletion Correcting Codes Sima, Jin; Bruck, Jehoshua IEEE Transactions on Information Theory, Vol. 67, Issue 6 https://doi.org/10.1109/TIT.2020.3028702	journal	June 2021

Similar Records

Asymptotically good codes correcting insertions, deletions, and transpositions

Conference · 1997 · OSTI ID:471724

Quantum deletion: Beyond the no-deletion principle

Journal Article · 2005 · Physical Review. A · OSTI ID:20786473

Congenitally corrected transposition in the adult: detection by radionuclide angiocardiography

Journal Article · 1985 · Radiology; (United States) · OSTI ID:6181365

Related Subjects

Computer Science
Engineering

Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions

Citation Formats

References (25)

Similar Records

Related Subjects