TY - GEN
T1 - Adversarial Torn-paper Codes
AU - Bar-Lev, Daniella
AU - Marcovich, Sagi
AU - Yaakobi, Eitan
AU - Yehezkeally, Yonatan
N1 - Funding Information:
This work was supported in part by the European Research Council (ERC) through the European Union’s Horizon 2020 Research and Innovation Programme under Grant 801434. D. Bar-Lev, S. Marcovich, and E. Yaakobi were supported in part by the United States-Israel BSF grant no. 2018048. Y. Yehezkeally was supported by a Carl Friedrich von Siemens postdoctoral research fellowship of the Alexander von Humboldt Foundation. The first, second, and fourth authors contributed equally to this work.
Publisher Copyright:
© 2022 IEEE.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - This paper studies the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry the information may break into smaller pieces that 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 that our constructions achieve optimal asymptotic 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 - This paper studies the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry the information may break into smaller pieces that 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 that our constructions achieve optimal asymptotic 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.
UR - http://www.scopus.com/inward/record.url?scp=85130100948&partnerID=8YFLogxK
U2 - 10.1109/ISIT50566.2022.9834766
DO - 10.1109/ISIT50566.2022.9834766
M3 - Conference contribution
AN - SCOPUS:85130100948
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2934
EP - 2939
BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE International Symposium on Information Theory, ISIT 2022
Y2 - 26 June 2022 through 1 July 2022
ER -