Optimizing fountain codes for DNA data storage

被引:0
|
作者
Schwarz, Peter Michael [1 ]
Freisleben, Bernd [1 ]
机构
[1] Univ Marburg, Dept Math & Comp Sci, Hans Meerwein Str 6, D-35043 Marburg, Germany
关键词
DNA; DNA storage; Optimization; Fountain codes; SYNTHESIS TECHNOLOGIES; DIGITAL INFORMATION; CAPACITY; ROBUST;
D O I
10.1016/j.csbj.2024.10.038
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Fountain codes, originally developed for reliable multicasting in communication networks, are effectively applied in various data transmission and storage systems. Their recent use in DNA data storage systems has unique challenges, since the DNA storage channel deviates from the traditional Gaussian white noise erasure model considered in communication networks and has several restrictions as well as special properties. Thus, optimizing fountain codes to address these challenges promises to improve their overall usability in DNA data storage systems. In this article, we present several methods for optimizing fountain codes for DNA data storage. Apart from generally applicable optimizations for fountain codes, we propose optimization algorithms to create tailored distribution functions of fountain codes, which is novel in the context of DNA data storage. We evaluate the proposed methods in terms of various metrics related to the DNA storage channel. Our evaluation shows that optimizing fountain codes for DNA data storage can significantly enhance the reliability and capacity of DNA data storage systems. The developed methods represent a step forward in harnessing the full potential of fountain codes for DNA-based data storage applications. The new coding schemes and all developed methods are available under a free and open-source software license.
引用
收藏
页码:3878 / 3896
页数:19
相关论文
共 50 条
  • [21] Repairable Fountain Codes
    Asteris, Megasthenis
    Dimakis, Alexandros G.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (05) : 1037 - 1047
  • [22] DNA Fountain enables a robust and efficient storage architecture
    Erlich, Yaniv
    Zielinski, Dina
    SCIENCE, 2017, 355 (6328) : 950 - 953
  • [23] Towards Fountain Codes
    Seyed Masoud Mirrezaei
    Karim Faez
    Shahram Yousefi
    Wireless Personal Communications, 2014, 77 : 1533 - 1562
  • [24] Repairable Fountain Codes
    Asteris, Megasthenis
    Dimakis, Alexandros G.
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [25] Concatenated Fountain Codes
    Wang, Zheng
    Luo, Jie
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2341 - 2345
  • [26] Fountain Codes for GNSS
    Fernandez-Hernandez, I.
    Calle, D.
    Cancela, S.
    Fernandez, A.
    Martinez, R.
    Seco-Granados, G.
    Walker, P.
    PROCEEDINGS OF THE 30TH INTERNATIONAL TECHNICAL MEETING OF THE SATELLITE DIVISION OF THE INSTITUTE OF NAVIGATION (ION GNSS+ 2017), 2017, : 1496 - 1507
  • [27] Error exponent for concatenated codes in DNA data storage under substitution errors
    Yuxuan SHI
    Shuo SHAO
    Xiaohang ZHANG
    Yongjian WANG
    Yongpeng WU
    Science China(Information Sciences), 2022, 65 (05) : 289 - 290
  • [28] Error exponent for concatenated codes in DNA data storage under substitution errors
    Shi, Yuxuan
    Shao, Shuo
    Zhang, Xiaohang
    Wang, Yongjian
    Wu, Yongpeng
    SCIENCE CHINA-INFORMATION SCIENCES, 2022, 65 (05)
  • [29] On Single-Error-Detecting Codes for DNA-Based Data Storage
    Weber, Jos H.
    de Groot, Joost A. M.
    van Leeuwen, Charlot J.
    IEEE COMMUNICATIONS LETTERS, 2021, 25 (01) : 41 - 44
  • [30] Evolutionary approach to construct robust codes for DNA-based data storage
    Rasool, Abdur
    Jiang, Qingshan
    Wang, Yang
    Huang, Xiaoluo
    Qu, Qiang
    Dai, Junbiao
    FRONTIERS IN GENETICS, 2023, 14