New Construction of Balanced Codes Based on Weights of Data for DNA Storage

被引:0
|
作者
Lu, Xiaozhou [1 ]
Kim, Sunghwan [1 ]
机构
[1] Univ Ulsan, Dept Elect Elect & Comp Engn, Ulsan 44610, South Korea
关键词
Balanced codes; DNA storage; GC-balanced; weight distribution; CONSTRAINED CODES; ERROR-CORRECTION; HIGH-CAPACITY; LENGTH;
D O I
10.1109/TETC.2023.3293477
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As maintaining a proper balanced GC content is crucial for minimizing errors in DNA storage, constructing GC-balanced DNA codes has become an important research topic. In this article, we propose a novel code construction method based on the weight distribution of the data, which enables us to construct GC-balanced DNA codes. Additionally, we introduce a specific encoding process for both balanced and imbalanced data parts. One of the key differences between the proposed codes and existing codes is that the parity lengths of the proposed codes are variable depending on the data parts, while the parity lengths of existing codes remain fixed. To evaluate the effectiveness of the proposed codes, we compare their average parity lengths to those of existing codes. Our results demonstrate that the proposed codes have significantly shorter average parity lengths for DNA sequences with appropriate GC contents.
引用
收藏
页码:973 / 984
页数:12
相关论文
共 50 条
  • [1] Efficient Balanced and Maximum Homopolymer-Run Restricted Block Codes for DNA-Based Data Storage
    Immink, Kees A. Schouhamer
    Cai, Kui
    IEEE COMMUNICATIONS LETTERS, 2019, 23 (10) : 1676 - 1679
  • [2] Data recovery methods for DNA storage based on fountain codes
    Schwarz, Peter Michael
    Freisleben, Bernd
    COMPUTATIONAL AND STRUCTURAL BIOTECHNOLOGY JOURNAL, 2024, 23 : 1808 - 1823
  • [3] Tabular construction of balanced codes
    Fair, I. J.
    Jamieson, C.
    ELECTRONICS LETTERS, 2013, 49 (16) : 997 - 998
  • [4] Properties and Constructions of Constrained Codes for DNA-Based Data Storage
    Immink, Kees A. Schouhamer
    Cai, Kui
    IEEE ACCESS, 2020, 8 : 49523 - 49531
  • [5] Optimizing fountain codes for DNA data storage
    Schwarz, Peter Michael
    Freisleben, Bernd
    COMPUTATIONAL AND STRUCTURAL BIOTECHNOLOGY JOURNAL, 2024, 23 : 3878 - 3896
  • [6] Greedy construction of DNA codes and new bounds
    Nabil Bennenni
    Kenza Guenda
    Thomas Aaron Gulliver
    Applicable Algebra in Engineering, Communication and Computing, 2019, 30 : 207 - 216
  • [7] Greedy construction of DNA codes and new bounds
    Bennenni, Nabil
    Guenda, Kenza
    Gulliver, Thomas Aaron
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2019, 30 (03) : 207 - 216
  • [8] 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
  • [9] 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
  • [10] Family of Constrained Codes for Archival DNA Data Storage
    Limbachiya, Dixita
    Gupta, Manish K.
    Aggarwal, Vancet
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (10) : 1972 - 1975