2025/04/24 by Yan Hao Ling, Ling, Yan Hao, Nir Weinberger +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Data Storage Technologies #Advanced biosensing and bioanalysis techniques #Coding (social sciences) #Converse #DNA and Biological Computing #Error detection and correction #Exponent #FOS: Computer and information sciences #Information Theory (cs.IT) #Matching (statistics) #Probability of error #Scaling
paper · pdf · doi:10.48550/arxiv.2504.17337
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2025/04/24 · openalex created_date 2025/10/11 · openalex updated_date 2026/08/05
In this paper, we study error exponents for a concatataned coding based class of DNA storage codes in which the number of reads performed can be variable. That is, the decoder can sequentially perform reads and choose whether to output the final decision or take more reads, and we are interested in minimizing the average number of reads performed rather than a fixed pre-specified value. We show that this flexibility leads to a considerable reduction in the error probability compared to a fixed number of reads, not only in terms of constants in the error exponent but also in the scaling laws. This is shown via an achievability result for a suitably-designed protocol, and in certain parameter regimes we additionally establish a matching converse that holds for all protocols within a broader concatenated coding based class.