{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:34:57Z","timestamp":1760236497225,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T00:00:00Z","timestamp":1637971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Due to the properties of DNA data storage, the errors that occur in DNA strands make error correction an important and challenging task. In this paper, a new code design of quaternary code suitable for DNA storage is proposed to correct at most two consecutive deletion or insertion errors. The decoding algorithms of the proposed codes are also presented when one and two deletion or insertion errors occur, and it is proved that the proposed code can correct at most two consecutive errors. Moreover, the lower and upper bounds on the cardinality of the proposed quaternary codes are also evaluated, then the redundancy of the proposed code is provided as roughly 2log48n.<\/jats:p>","DOI":"10.3390\/e23121592","type":"journal-article","created":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T05:23:02Z","timestamp":1638163382000},"page":"1592","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Quaternary Code Correcting a Burst of at Most Two Deletion or Insertion Errors in DNA Storage"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8800-8511","authenticated-orcid":false,"given":"Thi-Huong","family":"Khuat","sequence":"first","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 44610, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-5915","authenticated-orcid":false,"given":"Sunghwan","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 44610, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1038\/nature11875","article-title":"Towards practical, high-capacity, low-maintenance information storage in synthesized DNA","volume":"494","author":"Goldman","year":"2013","journal-title":"Nature"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","article-title":"Forward error correction for DNA data storage","volume":"80","author":"Blawat","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1126\/science.aaj2038","article-title":"DNA Fountain enables a robust and efficient storage architecture","volume":"355","author":"Erlich","year":"2016","journal-title":"Science"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-45832-6","article-title":"A characterization of the DNA data storage channel","volume":"9","author":"Heckel","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_5","first-page":"288","article-title":"A code that correctscorrects single asymmetric errors","volume":"26","author":"Varshamov","year":"1965","journal-title":"Autom. Telemkhanika"},{"key":"ref_6","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Dokl."},{"key":"ref_7","first-page":"298","article-title":"Asymptotically optimum binary codes with correction for losses of one or two adjacent bits","volume":"19","author":"Levenshtein","year":"1970","journal-title":"Syst. Theo. Res."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Cheng, L., Swart, T., Ferreira, H., and Abdel-Ghaffar, K. (July, January 29). Codes for correcting three or more consecutive deletions or insertions. Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875032"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1109\/TIT.2017.2661747","article-title":"Codes correcting a burst of deletions or insertions","volume":"63","author":"Schoeny","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Chee, Y., Kiah, H., and Nguyen, T. (2019, January 7\u201312). Linear-time encoders for codes correcting a single edit for DNA-based data storage. Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France.","DOI":"10.1109\/ISIT.2019.8849643"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"5602","DOI":"10.1109\/TIT.2021.3066430","article-title":"Capacity-approaching constrained codes with error correction for DNA-based data storage","volume":"67","author":"Nguyen","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Bornholt, J., Lopez, R., Carmean, D., Ceze, L., and Seelig, G. (2016, January 2\u20136). A DNA-based archival storage system. Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, Atlanta, GA, USA.","DOI":"10.1145\/2872362.2872397"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"R51","DOI":"10.1186\/gb-2013-14-5-r51","article-title":"Characterizing and measuring bias in sequence data","volume":"14","author":"Ross","year":"2013","journal-title":"Genome Bio."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3438","DOI":"10.1109\/TIT.2021.3049627","article-title":"Correcting a single indel\/edit for DNA-based data storage: Linear-time encoders and order-optimality","volume":"67","author":"Cai","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1109\/TIT.1984.1056962","article-title":"Nonbinary codes, correcting single deletion or insertion","volume":"30","author":"Tenengolts","year":"1984","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Schoeny, C., Sala, F., and Dolecek, L. (November, January 29). Novel combinatorial coding results for DNA sequencing and data storage. Proceedings of the 2017 51st Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2017.8335392"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Paluni, F., Swart, T., Weber, J., Ferreira, H., and Clarke, W. (2011, January 16\u201320). A note on non-binary multiple insertion\/deletion correcting codes. Proceedings of the 2011 IEEE Information Theory Workshop, Paraty, Brazil.","DOI":"10.1109\/ITW.2011.6089584"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2375","DOI":"10.1109\/TIT.2019.2950290","article-title":"Two deletion correcting codes from indicator vectors","volume":"66","author":"Sima","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Sima, J., Gabrys, R., and Bruck, J. (2020, January 21\u201326). Optimal codes for the q-ary deletion channel. Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Sima, J., Gabrys, R., and Bruck, J. (2020, January 21\u201326). Optimal systematic t-deletion correcting codes. Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3360","DOI":"10.1109\/TIT.2020.3028702","article-title":"On optimal k-deletion correcting codes","volume":"67","author":"Sima","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wang, S., Sima, J., and Farnoud, F. (2021, January 12\u201320). Non-binary codes for correcting a burst of at most 2 deletions. Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia.","DOI":"10.1109\/ISIT45174.2021.9517917"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"No, A. (2019). Nonasymptotic upper bounds on binary single deletion codes via mixed integer linear programming. Entropy, 21.","DOI":"10.3390\/e21121202"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"49523","DOI":"10.1109\/ACCESS.2020.2980036","article-title":"Properties and constructions of constrained codes for DNA-based data storage","volume":"8","author":"Immink","year":"2020","journal-title":"IEEE Access"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/12\/1592\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:36:50Z","timestamp":1760168210000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/12\/1592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,27]]},"references-count":24,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,12]]}},"alternative-id":["e23121592"],"URL":"https:\/\/doi.org\/10.3390\/e23121592","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,11,27]]}}}