Achieving the Capacity of a DNA Storage Channel with Linear Coding Schemes

Kel Levick, Reinhard Heckel, Ilan Shomorony

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Due to the redundant nature of DNA synthesis and sequencing technologies, a basic model for a DNA storage system is a multi-draw 'shuffling-sampling' channel. In this model, a random number of noisy copies of each sequence is observed at the channel output. Recent works have characterized the capacity of such a DNA storage channel under different noise and sequencing models, relying on sophisticated typicality-based approaches for the achievability. Here, we consider a multi-draw DNA storage channel in the setting of noise corruption by a binary erasure channel. We show that, in this setting, the capacity is achieved by linear coding schemes. This leads to a considerably simpler derivation of the capacity expression of a multi-draw DNA storage channel than existing results in the literature.

Original languageEnglish (US)
Title of host publication2022 56th Annual Conference on Information Sciences and Systems, CISS 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages218-223
Number of pages6
ISBN (Electronic)9781665417969
DOIs
StatePublished - 2022
Event56th Annual Conference on Information Sciences and Systems, CISS 2022 - Princeton, United States
Duration: Mar 9 2022Mar 11 2022

Publication series

Name2022 56th Annual Conference on Information Sciences and Systems, CISS 2022

Conference

Conference56th Annual Conference on Information Sciences and Systems, CISS 2022
Country/TerritoryUnited States
CityPrinceton
Period3/9/223/11/22

Keywords

  • DNA storage
  • channel capacity
  • linear codes

ASJC Scopus subject areas

  • Information Systems and Management
  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems

Fingerprint

Dive into the research topics of 'Achieving the Capacity of a DNA Storage Channel with Linear Coding Schemes'. Together they form a unique fingerprint.

Cite this