.png){kind=icon}
.png){kind=icon}
Return
Embracing Errors Can Be More Efficient Than Avoiding Them Through Constrained Coding for DNA Data Storage
.png){kind=icon}
PRE
AI
DOI：10.1109/TMBMC.2025.3610330.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
DNA is an attractive medium for digital data storage. When data is stored on DNA, errors occur, making error-correcting codes critical for reliable storage. A common approach to reduce errors is constrained coding, which avoids homopolymers (consecutive repeated nucleotides) and balances GC content, as they are associated with higher error rates. However, constrained coding comes at the cost of an increase in redundancy. An alternative is to randomize DNA sequences, embrace errors, and compensate with additional coding redundancy. In this paper, we identify the error regimes in which embracing substitution errors is more efficient than constrained coding. Our results indicate that constrained coding for substitution errors can be inefficient in current DNA data storage systems. Theoretical analysis shows that constrained coding would be efficient only under high error rates in homopolymers and GC-imbalanced sequences, while empirical data show that error-rate increases for these nucleotides are minimal in current systems.
Keywords:
Codes
DNA data storage
Channel coding
Error analysis
Redundancy
Decoding
Error correction codes
DNA sequencing
Costs
Systematics
constrained coding
random coding
achievable code rates
Gilbert-Varshamov bounds
Journal
I
IF:
2.3
Papers:
69
Citations:
551