Adversarial Torn-Paper Codes

Daniella Bar-Lev; Sagi Marcovich; Eitan Yaakobi; Yonatan Yehezkeally

doi:10.1109/TIT.2023.3292895

Adversarial Torn-Paper Codes

Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi, Yonatan Yehezkeally

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

1 Scopus citations

Abstract

We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller pieces which are received out of order. Our model extends the previously researched probabilistic setting to the worst-case. We develop code constructions for any parameters of the channel for which non-vanishing asymptotic rate is possible and show our constructions achieve asymptotically optimal rate while allowing for efficient encoding and decoding. Finally, we extend our results to related settings included multi-strand storage, presence of substitution errors, or incomplete coverage.

Original language	English
Pages (from-to)	6414-6427
Number of pages	14
Journal	IEEE Transactions on Information Theory
Volume	69
Issue number	10
DOIs	https://doi.org/10.1109/TIT.2023.3292895
State	Published - 1 Oct 2023
Externally published	Yes

Keywords

DNA sequences
error correction codes
Sequence reconstruction
worst-case analysis

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2023.3292895

Cite this

@article{24d8220188f643baaa195e1c8032a4d8,

title = "Adversarial Torn-Paper Codes",

abstract = "We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller pieces which are received out of order. Our model extends the previously researched probabilistic setting to the worst-case. We develop code constructions for any parameters of the channel for which non-vanishing asymptotic rate is possible and show our constructions achieve asymptotically optimal rate while allowing for efficient encoding and decoding. Finally, we extend our results to related settings included multi-strand storage, presence of substitution errors, or incomplete coverage.",

keywords = "DNA sequences, error correction codes, Sequence reconstruction, worst-case analysis",

author = "Daniella Bar-Lev and Sagi Marcovich and Eitan Yaakobi and Yonatan Yehezkeally",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2023",

month = oct,

day = "1",

doi = "10.1109/TIT.2023.3292895",

language = "English",

volume = "69",

pages = "6414--6427",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "10",

}

TY - JOUR

T1 - Adversarial Torn-Paper Codes

AU - Bar-Lev, Daniella

AU - Marcovich, Sagi

AU - Yaakobi, Eitan

AU - Yehezkeally, Yonatan

PY - 2023/10/1

Y1 - 2023/10/1

N2 - We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller pieces which are received out of order. Our model extends the previously researched probabilistic setting to the worst-case. We develop code constructions for any parameters of the channel for which non-vanishing asymptotic rate is possible and show our constructions achieve asymptotically optimal rate while allowing for efficient encoding and decoding. Finally, we extend our results to related settings included multi-strand storage, presence of substitution errors, or incomplete coverage.

AB - We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller pieces which are received out of order. Our model extends the previously researched probabilistic setting to the worst-case. We develop code constructions for any parameters of the channel for which non-vanishing asymptotic rate is possible and show our constructions achieve asymptotically optimal rate while allowing for efficient encoding and decoding. Finally, we extend our results to related settings included multi-strand storage, presence of substitution errors, or incomplete coverage.

KW - DNA sequences

KW - error correction codes

KW - Sequence reconstruction

KW - worst-case analysis

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

U2 - 10.1109/TIT.2023.3292895

DO - 10.1109/TIT.2023.3292895

M3 - Article

AN - SCOPUS:85164396216

SN - 0018-9448

VL - 69

SP - 6414

EP - 6427

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 10

ER -

Adversarial Torn-Paper Codes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this