Achievable Rates and Error Probability Bounds of Frequency-based Channels of Unlimited Input Resolution
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_ | 1866909594290225152 |
|---|---|
| author | Tamir, Ran Weinberger, Nir |
| author_facet | Tamir, Ran Weinberger, Nir |
| contents | We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool. Motivated by recent DNA storage techniques, we focus on the regime in which the input resolution is unlimited. We propose two error probability bounds for this channel; the first bound is based on random coding analysis of the error probability of the maximum likelihood decoder and the second bound is derived by code expurgation techniques. We deduce an achievable bound on the capacity of this channel, and compare it to both the achievable bounds under limited input resolution, as well as to a converse bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_18364 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Achievable Rates and Error Probability Bounds of Frequency-based Channels of Unlimited Input Resolution Tamir, Ran Weinberger, Nir Information Theory We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool. Motivated by recent DNA storage techniques, we focus on the regime in which the input resolution is unlimited. We propose two error probability bounds for this channel; the first bound is based on random coding analysis of the error probability of the maximum likelihood decoder and the second bound is derived by code expurgation techniques. We deduce an achievable bound on the capacity of this channel, and compare it to both the achievable bounds under limited input resolution, as well as to a converse bound. |
| title | Achievable Rates and Error Probability Bounds of Frequency-based Channels of Unlimited Input Resolution |
| topic | Information Theory |
| url | https://arxiv.org/abs/2504.18364 |