On Optimal Family of Codes for Archival DNA Storage
Information Theory
2016-04-25 v2 math.IT
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.
Keywords
Cite
@article{arxiv.1501.07133,
title = {On Optimal Family of Codes for Archival DNA Storage},
author = {Dixita Limbachiya and Vijay Dhameliya and Madhav Khakhar and Manish K Gupta},
journal= {arXiv preprint arXiv:1501.07133},
year = {2016}
}
Comments
Supplementary file and the software DNA Cloud 2.0 is available at http://www.guptalab.org/dnacloud This is the preliminary version of the paper that appeared in Proceedings of IWSDA 2015, pp. 143--147