A Caltech Library Service

Robust Indexing - Optimal Codes for DNA Storage

Sima, Jin and Raviv, Netanel and Bruck, Jehoshua (2020) Robust Indexing - Optimal Codes for DNA Storage. In: 2020 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 717-722. ISBN 9781728164328.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


The channel model of encoding data as a set of unordered strings is receiving great attention as it captures the basic features of DNA storage systems. However, the challenge of constructing optimal redundancy codes for this channel remained elusive. In this paper, we solve this open problem and present an order-wise optimal construction of codes that correct multiple substitution errors for this channel model. The key ingredient in the code construction is a technique we call robust indexing: instead of using fixed indices to create order in unordered strings, we use indices that are information dependent and thus eliminate unnecessary redundancy. In addition, our robust indexing technique can be applied to the construction of optimal deletion/insertion codes for this channel.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Sima, Jin0000-0003-4588-9790
Raviv, Netanel0000-0002-1686-1994
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© 2020 IEEE.
Record Number:CaltechAUTHORS:20200831-134827466
Persistent URL:
Official Citation:J. Sima, N. Raviv and J. Bruck, "Robust Indexing - Optimal Codes for DNA Storage," 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 717-722, doi: 10.1109/ISIT44484.2020.9174447
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:105175
Deposited By: Tony Diaz
Deposited On:08 Sep 2020 23:30
Last Modified:16 Nov 2021 18:40

Repository Staff Only: item control page