Properties of Maxentropic DNA Synthesis Codes †

Journal article (2024)

Authors

Kees A. Schouhamer Immink Turing Machines Inc.
J.H. Weber Discrete Mathematics and Optimization - EEMCS
Kui Cai Singapore University of Technology and Design
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
More Info
expand_more

Published Date

2024

Language

English

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

Abstract

Low-weight codes have been proposed for efficiently synthesizing deoxyribonucleic acid (DNA) for massive data storage, where a multiple of DNA strands are synthesized in parallel. We report on the redundancy and information rate of maxentropic low-weight codes for asymptotically large codeword length. We compare the performance of low-complexity nibble replacement (NR) codes, which are designed to minimize the synthesis time, with the performance of maxentropic low-weight codes. Finally, the asymptotic redundancy and information rate of codes with a runlength limitation are investigated.