On optimal family of codes for archival DNA storage

Abstract

DNA based storage systems received attention by many researchers in the last few years. 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 the DNA sequences using non-linear family of ternary codes. In particular, we propose an algorithm to encode data into DNA with high information storage density for archival storage using the sub-code of the Golay code. Theoretically, 115 exabytes (EB) data can be stored in one gram of DNA using our method.