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 条
  • [11] Locality-aware fountain codes for massive distributed storage systems
    Okpotse, Toritseju
    Yousefi, Shahram
    2015 IEEE 14TH CANADIAN WORKSHOP ON INFORMATION THEORY (CWIT), 2015, : 18 - 21
  • [12] Systematic Fountain Codes for Massive Storage Using the Truncated Poisson Distribution
    Okpotse, Toritseju
    Yousefi, Shahram
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (02) : 943 - 954
  • [13] Distributed Date Storage Based on Fountain Codes for Space Information Network
    Kong, Bo
    Xie, Zhidong
    Zhang, Wei
    Zhang, Gengxin
    Cheng, Lei
    2015 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS & SIGNAL PROCESSING (WCSP), 2015,
  • [14] Locality-Improved Repairable Fountain Codes for Distributed Storage Systems
    Baik, Jonghyun
    Suh, Youngkil
    Shin, Myeongcheol
    Kim, Sungsoo
    Kim, Joonsuk
    ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2020,
  • [15] Secure and Private Cloud Storage Systems with Random Linear Fountain Codes
    Kiskani, Mohsen Karimzadeh
    Sadjadpour, Hamid R.
    2017 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTED, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2017,
  • [16] Codes for DNA Storage Channels
    Kiah, Han Mao
    Puleo, Gregory J.
    Milenkovic, Olgica
    2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
  • [17] Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
    Jain, Siddharth
    Farnoud , Farzad
    Schwartz, Moshe
    Bruck, Jehoshua
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1028 - 1032
  • [18] Properties and Constructions of Constrained Codes for DNA-Based Data Storage
    Immink, Kees A. Schouhamer
    Cai, Kui
    IEEE ACCESS, 2020, 8 : 49523 - 49531
  • [19] New Construction of Balanced Codes Based on Weights of Data for DNA Storage
    Lu, Xiaozhou
    Kim, Sunghwan
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2023, 11 (04) : 973 - 984
  • [20] Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
    Jain, Siddharth
    Farnoud , Farzad
    Schwartz, Moshe
    Bruck, Jehoshua
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (08) : 4996 - 5010