Reconstruction of Sequences Distorted by Two Insertions

Zuo Ye; Xin Liu; Xiande Zhang; Gennian Ge

doi:10.1109/TIT.2023.3260872

Reconstruction of Sequences Distorted by Two Insertions

Zuo Ye, Xin Liu, Xiande Zhang, Gennian Ge

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in 2001 and developed recently due to applications in modern storage devices such as racetrack memories and DNA storage. The central problem on this topic is to design codes with redundancy as small as possible for a given number N of noisy reads. In this paper, the minimum redundancy of such codes for binary channels with exactly two insertions is determined asymptotically for all values of N ≥ 5. Previously, such codes were studied only for channels with single edit errors or two-deletion errors.

Original language	English
Pages (from-to)	4977-4992
Number of pages	16
Journal	IEEE Transactions on Information Theory
Volume	69
Issue number	8
DOIs	https://doi.org/10.1109/TIT.2023.3260872
State	Published - 1 Aug 2023

Keywords

DNA storage
insertion channel
Sequence reconstruction

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2023.3260872

Cite this

@article{cb536d13b0294011b272b9fffb9b65ad,

title = "Reconstruction of Sequences Distorted by Two Insertions",

abstract = "Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in 2001 and developed recently due to applications in modern storage devices such as racetrack memories and DNA storage. The central problem on this topic is to design codes with redundancy as small as possible for a given number N of noisy reads. In this paper, the minimum redundancy of such codes for binary channels with exactly two insertions is determined asymptotically for all values of N ≥ 5. Previously, such codes were studied only for channels with single edit errors or two-deletion errors.",

keywords = "DNA storage, insertion channel, Sequence reconstruction",

author = "Zuo Ye and Xin Liu and Xiande Zhang and Gennian Ge",

note = "Funding Information: This work was supported in part by the National Key Research and Development Program of China under Grant 2020YFA0712100, Grant 2018YFA0704703, and Grant 2020YFA0713100; in part by the National Natural Science Foundation of China under Grant 11971325, Grant 12171452, and Grant 12231014; in part by the Beijing Scholars Program; and in part by the Innovation Program for Quantum Science and Technology under Grant 2021ZD0302904. Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2023",

month = aug,

day = "1",

doi = "10.1109/TIT.2023.3260872",

language = "English",

volume = "69",

pages = "4977--4992",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "8",

}

TY - JOUR

T1 - Reconstruction of Sequences Distorted by Two Insertions

AU - Ye, Zuo

AU - Liu, Xin

AU - Zhang, Xiande

AU - Ge, Gennian

N1 - Funding Information: This work was supported in part by the National Key Research and Development Program of China under Grant 2020YFA0712100, Grant 2018YFA0704703, and Grant 2020YFA0713100; in part by the National Natural Science Foundation of China under Grant 11971325, Grant 12171452, and Grant 12231014; in part by the Beijing Scholars Program; and in part by the Innovation Program for Quantum Science and Technology under Grant 2021ZD0302904. Publisher Copyright: © 1963-2012 IEEE.

PY - 2023/8/1

Y1 - 2023/8/1

N2 - Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in 2001 and developed recently due to applications in modern storage devices such as racetrack memories and DNA storage. The central problem on this topic is to design codes with redundancy as small as possible for a given number N of noisy reads. In this paper, the minimum redundancy of such codes for binary channels with exactly two insertions is determined asymptotically for all values of N ≥ 5. Previously, such codes were studied only for channels with single edit errors or two-deletion errors.

AB - Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in 2001 and developed recently due to applications in modern storage devices such as racetrack memories and DNA storage. The central problem on this topic is to design codes with redundancy as small as possible for a given number N of noisy reads. In this paper, the minimum redundancy of such codes for binary channels with exactly two insertions is determined asymptotically for all values of N ≥ 5. Previously, such codes were studied only for channels with single edit errors or two-deletion errors.

KW - DNA storage

KW - insertion channel

KW - Sequence reconstruction

UR - http://www.scopus.com/inward/record.url?scp=85151570167&partnerID=8YFLogxK

U2 - 10.1109/TIT.2023.3260872

DO - 10.1109/TIT.2023.3260872

M3 - Article

AN - SCOPUS:85151570167

SN - 0018-9448

VL - 69

SP - 4977

EP - 4992

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 8

ER -

Reconstruction of Sequences Distorted by Two Insertions

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this