Error Exponents for DNA Storage Codes with a Variable Number of Reads
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909591790419968 |
|---|---|
| author | Ling, Yan Hao Weinberger, Nir Scarlett, Jonathan |
| author_facet | Ling, Yan Hao Weinberger, Nir Scarlett, Jonathan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_17337 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Error Exponents for DNA Storage Codes with a Variable Number of Reads Ling, Yan Hao Weinberger, Nir Scarlett, Jonathan Information Theory 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. |
| title | Error Exponents for DNA Storage Codes with a Variable Number of Reads |
| topic | Information Theory |
| url | https://arxiv.org/abs/2504.17337 |