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 条
  • [31] 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
  • [32] Codes in the Damerau Distance for DNA Storage
    Gabrys, Ryan
    Yaakobi, Eitan
    Milenkovic, Olgica
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2644 - 2648
  • [33] Mutually Uncorrelated Codes for DNA Storage
    Levy, Maya
    Yaakobi, Eitan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (06) : 3671 - 3691
  • [34] Mutually Uncorrelated Codes for DNA Storage
    Levy, Maya
    Yaakobi, Eitan
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [35] Rank Modulation Codes for DNA Storage
    Raviv, Netanel
    Schwartz, Moshe
    Yaakobi, Eitan
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [36] LDPC Codes for Portable DNA Storage
    Fei, Peng
    Wang, Zhiying
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 76 - 80
  • [37] Data extraction from wireless sensor networks using fountain codes
    Oka, Anand
    Lampe, Lutz
    2007 2ND IEEE INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING, 2007, : 53 - 56
  • [38] Data Broadcasting over DAB/DMB with Fountain Codes and Auxilliary Mobile Data Channels
    Alexandre, Paulo
    Vieira, Jose
    Navarro, Antonio
    2014 16TH INTERNATIONAL TELECOMMUNICATIONS NETWORK STRATEGY AND PLANNING SYMPOSIUM (NETWORKS), 2014,
  • [40] Controlled Flooding of Fountain Codes
    Bin Abbas, Waqas
    Casari, Paolo
    Zorzi, Michele
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (07) : 4698 - 4710