On Optimal Family of Codes for Archival DNA Storage
Dixita Limbachiya, Vijay Dhameliya, Madhav Khakhar, Manish K Gupta

TL;DR
This paper introduces a novel DNA storage encoding method using non-linear ternary codes and Golay code subcodes, achieving high data density and improved error correction for archival DNA storage.
Contribution
It presents a new encoding algorithm for DNA storage that enhances data density and error correction using non-linear ternary codes and Golay code subcodes.
Findings
Theoretically, 115 exabytes of data can be stored in one gram of DNA.
The proposed method improves error correction capabilities.
It achieves higher information storage density.
Abstract
DNA based storage systems received attention by many researchers. This includes archival and re-writable random access DNA based storage systems. In this work, we have developed an efficient technique to encode the data into DNA sequence by using non-linear families of ternary codes. In particular, we proposes an algorithm to encode data into DNA with high information storage density and better error correction using a sub code of Golay code. Theoretically, 115 exabytes (EB) data can be stored in one gram of DNA by our method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
