当前位置: X-MOL 学术IEEE Trans. Emerg. Top. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
New Construction of Balanced Codes Based on Weights of Data for DNA Storage
IEEE Transactions on Emerging Topics in Computing ( IF 5.9 ) Pub Date : 2023-07-13 , DOI: 10.1109/tetc.2023.3293477
Xiaozhou Lu 1 , Sunghwan Kim 1
Affiliation  

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.

中文翻译:

基于数据权重的DNA存储平衡码的新构建

由于保持适当平衡的 GC 含量对于最大限度地减少 DNA 存储中的错误至关重要,因此构建 GC 平衡的 DNA 代码已成为一个重要的研究课题。在本文中,我们提出了一种基于数据权重分布的新型代码构建方法,使我们能够构建 GC 平衡的 DNA 代码。此外,我们还为平衡和不平衡数据部分引入了特定的编码过程。所提出的代码和现有代码之间的主要区别之一是所提出的代码的奇偶校验长度根据数据部分而变化,而现有代码的奇偶校验长度保持固定。为了评估所提出的代码的有效性,我们将它们的平均奇偶校验长度与现有代码的平均奇偶校验长度进行了比较。我们的结果表明,对于具有适当 GC 含量的 DNA 序列,所提出的代码具有显着更短的平均奇偶校验长度。
更新日期:2023-07-13
down
wechat
bug