New Construction of Balanced Codes Based on Weights of Data for DNA Storage
- Abstract
- 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.
- Author(s)
- Xiaozhou Lu; Sunghwan Kim
- Issued Date
- 2023
- Type
- Article
- Keyword
- Balanced codes; DNA storage; GC-balanced; weight distribution
- DOI
- 10.1109/TETC.2023.3293477
- URI
- https://oak.ulsan.ac.kr/handle/2021.oak/16656
- Publisher
- IEEE transactions on emerging topics in computing
- Language
- 영어
- ISSN
- 2168-6750
- Citation Volume
- 11
- Citation Number
- 4
- Citation Start Page
- 973
- Citation End Page
- 984
-
Appears in Collections:
- Engineering > IT Convergence
- 공개 및 라이선스
-
- 파일 목록
-
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.