Uncertainty of reconstruction with list-decoding from uniform-tandem-duplication noise

Yonatan Yehezkeally, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review


We propose a list-decoding scheme for reconstruction codes in the context of uniform-tandem-duplication noise, which can be viewed as an application of the associative memory model to this setting. We find the uncertainty associated with m>2 strings (where a previous paper considered m=2 ) in asymptotic terms, where code-words are taken from an error-correcting code. Thus, we find the trade-off between the design minimum distance, the number of errors, the acceptable list size and the resulting uncertainty, which corresponds to the required number of distinct retrieved outputs for successful reconstruction. It is therefore seen that by accepting list-decoding one may decrease coding redundancy, or the required number of reads, or both.

Original languageAmerican English
Article number9393394
Pages (from-to)4276-4287
Number of pages12
JournalIEEE Transactions on Information Theory
Issue number7
StatePublished - 1 Jul 2021


  • DNA storage
  • List decoding
  • Reconstruction
  • String-duplication systems

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Uncertainty of reconstruction with list-decoding from uniform-tandem-duplication noise'. Together they form a unique fingerprint.

Cite this