Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913379376955392 |
|---|---|
| author | Ling, Yan Hao Scarlett, Jonathan |
| author_facet | Ling, Yan Hao Scarlett, Jonathan |
| contents | In this paper, we study the problem of relaying a single bit over a tandem of binary-input channels, with the goal of attaining the highest possible error exponent in the exponentially decaying error probability. Our previous work gave an exact characterization of the best possible error exponent in various special cases, including when the two channels are identical, but the general case was left as an open problem. We resolve this open problem by deriving a new converse bound that matches our existing achievability bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_14251 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels Ling, Yan Hao Scarlett, Jonathan Information Theory In this paper, we study the problem of relaying a single bit over a tandem of binary-input channels, with the goal of attaining the highest possible error exponent in the exponentially decaying error probability. Our previous work gave an exact characterization of the best possible error exponent in various special cases, including when the two channels are identical, but the general case was left as an open problem. We resolve this open problem by deriving a new converse bound that matches our existing achievability bound. |
| title | Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2311.14251 |