Exact Error Exponents of Concatenated Codes for DNA Storage

Abstract

In this paper, we consider a concatenated coding based class of DNA storage codes in which the selected molecules are constrained to be taken from an “inner” codebook associated with the sequencing channel. This codebook is used in a “closed-box” manner, and is only assumed to operate at an achievable rate in the sense of attaining asymptotically vanishing maximal (inner) error probability. We first derive the exact error exponent in a widely-studied regime of constant rate and a linear number of sequencing reads, and show strict improvements over an existing achievable error exponent. Moreover, our achievability analysis is based on a coded-index strategy, implying that such strategies attain the highest error exponents within the broader class of codes that we consider. We then extend our results to other scaling regimes, including a super-linear number of reads, as well as several low-rate regimes. We find that the latter comes with notable intricacies, such as dependencies of the error exponents on the model for sequencing errors.