On Optimal Family of Codes for DNA Storage

نویسندگان

  • Vijay Dhameliya
  • Dixita Limbachiya
  • Madhav Khakhar
  • Manish K. Gupta
چکیده

Advancement in the technology has generated immense data which has become a burning issue for data storage experts. To accommodate the data and cope up with demand, computer scientist are striving to produce the improved, dense and reliable data storage medium. The main challenge for the development of optimum data storage medium is enhancement in storage capacity, reliability and security. Various applications of DNA in computing technologies and its dense, stable, reliable nature enticed the researcher to use DNA as storage medium. The idea of using DNA as storage medium has many success stories but the main challenges to deal with are error correction and cost associated with the DNA sequencing and synthesis. In this work, we have developed an efficient technique to encode the data into DNA by using nonlinear family of ternary codes. This gives us significant reduction in file size for storing data on DNA from previous developed methods. Using our method one can store 1.15 ExaBytes (EB) of information in one gram of DNA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Non-MDS Erasure Code Scheme for Storage Applications

This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...

متن کامل

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

Optimal ternary cyclic codes with minimum distance four and five

Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first family of cyclic codes has parameters [3m−1,3m−1−2m,4] and contains a class of conjectured cyclic codes and several new classes of optimal cyclic codes. The ...

متن کامل

Coding over Sets for DNA Storage

In this paper we study error-correcting codes for the storage of data in synthetic DNA. We investigate a storage model where a data set is represented by an unordered set of M sequences, each of length L. Errors within that model are losses of whole sequences and point errors inside the sequences, such as insertions, deletions and substitutions. We propose code constructions which can correct e...

متن کامل

XORing Elephants: Novel Erasure Codes for Big Data

Distributed storage systems for large clusters typically use replication to provide reliability. Recently, erasure codes have been used to reduce the large storage overhead of threereplicated systems. Reed-Solomon codes are the standard design choice and their high repair cost is often considered an unavoidable price to pay for high storage efficiency and high reliability. This paper shows how ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1501.07133  شماره 

صفحات  -

تاریخ انتشار 2015