Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels
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_ | 1866910794126458880 |
|---|---|
| author | Boche, Holger Deppe, Christian Mahmoodi, Safieh Omidi, Golamreza |
| author_facet | Boche, Holger Deppe, Christian Mahmoodi, Safieh Omidi, Golamreza |
| contents | Deterministic identification offers an efficient solution for scenarios where decoding entire messages is unnecessary. It is commonly used in alarm systems and control systems. A key advantage of this approach is that the capacity for deterministic identification in Gaussian channels with power constraints grows superexponentially, unlike Shannon's transmission capacity. This allows for a significantly higher number of messages to be transmitted using this event-driven method. So far, only upper and lower bounds for deterministic identification capacity have been established. Our work introduces a novel construction: galaxy codes for deterministic identification. Using these codes, we demonstrate an improvement in the achievability bound of 1/4 to 3/8, representing a previously unknown advance that opens new possibilities for efficient communication. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_12548 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels Boche, Holger Deppe, Christian Mahmoodi, Safieh Omidi, Golamreza Information Theory Deterministic identification offers an efficient solution for scenarios where decoding entire messages is unnecessary. It is commonly used in alarm systems and control systems. A key advantage of this approach is that the capacity for deterministic identification in Gaussian channels with power constraints grows superexponentially, unlike Shannon's transmission capacity. This allows for a significantly higher number of messages to be transmitted using this event-driven method. So far, only upper and lower bounds for deterministic identification capacity have been established. Our work introduces a novel construction: galaxy codes for deterministic identification. Using these codes, we demonstrate an improvement in the achievability bound of 1/4 to 3/8, representing a previously unknown advance that opens new possibilities for efficient communication. |
| title | Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.12548 |