pith. sign in

arxiv: 1501.07133 · v2 · pith:BCIWEFM5new · submitted 2015-01-28 · 💻 cs.IT · math.IT

On Optimal Family of Codes for Archival DNA Storage

classification 💻 cs.IT math.IT
keywords storagedataarchivalcodecodesencodesystemsaccess
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.