Identification via Gaussian Multiple Access Channels in the Presence of Feedback
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910569245704192 |
|---|---|
| author | Zhao, Yaning Labidi, Wafa Boche, Holger Jorswieck, Eduard Deppe, Christian |
| author_facet | Zhao, Yaning Labidi, Wafa Boche, Holger Jorswieck, Eduard Deppe, Christian |
| contents | We investigate message identification over a K-sender Gaussian multiple access channel (K-GMAC). Unlike conventional Shannon transmission codes, the size of randomized identification (ID) codes experiences a doubly exponential growth in the code length. Improvements in the ID approach can be attained through additional resources such as quantum entanglement, common randomness (CR), and feedback. It has been demonstrated that an infinite capacity can be attained for a single-user Gaussian channel with noiseless feedback, irrespective of the chosen rate scaling. We establish the capacity region of both the K-sender Gaussian multiple access channel (K-GMAC) and the K-sender state-dependent Gaussian multiple access channel (K-SD-GMAC) when strictly causal noiseless feedback is available. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_09119 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Identification via Gaussian Multiple Access Channels in the Presence of Feedback Zhao, Yaning Labidi, Wafa Boche, Holger Jorswieck, Eduard Deppe, Christian Information Theory We investigate message identification over a K-sender Gaussian multiple access channel (K-GMAC). Unlike conventional Shannon transmission codes, the size of randomized identification (ID) codes experiences a doubly exponential growth in the code length. Improvements in the ID approach can be attained through additional resources such as quantum entanglement, common randomness (CR), and feedback. It has been demonstrated that an infinite capacity can be attained for a single-user Gaussian channel with noiseless feedback, irrespective of the chosen rate scaling. We establish the capacity region of both the K-sender Gaussian multiple access channel (K-GMAC) and the K-sender state-dependent Gaussian multiple access channel (K-SD-GMAC) when strictly causal noiseless feedback is available. |
| title | Identification via Gaussian Multiple Access Channels in the Presence of Feedback |
| topic | Information Theory |
| url | https://arxiv.org/abs/2408.09119 |