Function Computation and Identification over Locally Homomorphic Multiple-Access Channels
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913324258557952 |
|---|---|
| author | Rosenberger, Johannes Boche, Holger Cabrera, Juan A. Deppe, Christian |
| author_facet | Rosenberger, Johannes Boche, Holger Cabrera, Juan A. Deppe, Christian |
| contents | We develop the notion of a locally homomorphic channel and prove an approximate equivalence between those and codes for computing functions. Further, we derive decomposition properties of locally homomorphic channels which we use to analyze and construct codes where two messages must be encoded independently. This leads to new results for identification and K-identification when all messages are sent over multiple-access channels, which yield surprising rate improvements compared to naive code constructions. In particular, we demonstrate that for the example of identification with deterministic encoders, both encoders can be constructed independently. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_14390 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Function Computation and Identification over Locally Homomorphic Multiple-Access Channels Rosenberger, Johannes Boche, Holger Cabrera, Juan A. Deppe, Christian Information Theory We develop the notion of a locally homomorphic channel and prove an approximate equivalence between those and codes for computing functions. Further, we derive decomposition properties of locally homomorphic channels which we use to analyze and construct codes where two messages must be encoded independently. This leads to new results for identification and K-identification when all messages are sent over multiple-access channels, which yield surprising rate improvements compared to naive code constructions. In particular, we demonstrate that for the example of identification with deterministic encoders, both encoders can be constructed independently. |
| title | Function Computation and Identification over Locally Homomorphic Multiple-Access Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2404.14390 |