Function Computation and Identification over Locally Homomorphic Multiple-Access Channels

Function Computation and Identification over Locally Homomorphic Multiple-Access Channels

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 inde...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rosenberger, Johannes, Boche, Holger, Cabrera, Juan A, Deppe, Christian
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Rosenberger, Johannes
Boche, Holger
Cabrera, Juan A
Deppe, Christian
description 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.
doi_str_mv 10.48550/arxiv.2404.14390
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2404_14390</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2404_14390</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-1006140ced757f5482f44695bd1d7f66c3704ae5b35dc6d2339a25859344ae9c3</originalsourceid><addsrcrecordid>eNotj71qwzAYRbV0KGkfoFP1AnYl65NkjcE0TcClS5ZORtEPEciyke3QvH1Tp9zhXs5w4SD0QkkJNefkTeefcCkrIFBSYIo8ou_dkswchoSboR-XWa9bJ4sP1qU5-GDuaLi4jNvB6BiveD_0t-TxHAz-XOIcxuiKrTFumnBz1im5OD2hB6_j5J7_e4OOu_djsy_ar49Ds20LLSQpKCGCAjHOSi49h7ryAELxk6VWeiEMkwS04yfGrRG2YkzpitdcMbhhZdgGvd5vV7duzKHX-dr9OXarI_sFsxBM2w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Function Computation and Identification over Locally Homomorphic Multiple-Access Channels</title><source>arXiv.org</source><creator>Rosenberger, Johannes ; Boche, Holger ; Cabrera, Juan A ; Deppe, Christian</creator><creatorcontrib>Rosenberger, Johannes ; Boche, Holger ; Cabrera, Juan A ; Deppe, Christian</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2404.14390</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2024-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2404.14390$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2404.14390$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Rosenberger, Johannes</creatorcontrib><creatorcontrib>Boche, Holger</creatorcontrib><creatorcontrib>Cabrera, Juan A</creatorcontrib><creatorcontrib>Deppe, Christian</creatorcontrib><title>Function Computation and Identification over Locally Homomorphic Multiple-Access Channels</title><description>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.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71qwzAYRbV0KGkfoFP1AnYl65NkjcE0TcClS5ZORtEPEciyke3QvH1Tp9zhXs5w4SD0QkkJNefkTeefcCkrIFBSYIo8ou_dkswchoSboR-XWa9bJ4sP1qU5-GDuaLi4jNvB6BiveD_0t-TxHAz-XOIcxuiKrTFumnBz1im5OD2hB6_j5J7_e4OOu_djsy_ar49Ds20LLSQpKCGCAjHOSi49h7ryAELxk6VWeiEMkwS04yfGrRG2YkzpitdcMbhhZdgGvd5vV7duzKHX-dr9OXarI_sFsxBM2w</recordid><startdate>20240422</startdate><enddate>20240422</enddate><creator>Rosenberger, Johannes</creator><creator>Boche, Holger</creator><creator>Cabrera, Juan A</creator><creator>Deppe, Christian</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240422</creationdate><title>Function Computation and Identification over Locally Homomorphic Multiple-Access Channels</title><author>Rosenberger, Johannes ; Boche, Holger ; Cabrera, Juan A ; Deppe, Christian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-1006140ced757f5482f44695bd1d7f66c3704ae5b35dc6d2339a25859344ae9c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Rosenberger, Johannes</creatorcontrib><creatorcontrib>Boche, Holger</creatorcontrib><creatorcontrib>Cabrera, Juan A</creatorcontrib><creatorcontrib>Deppe, Christian</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rosenberger, Johannes</au><au>Boche, Holger</au><au>Cabrera, Juan A</au><au>Deppe, Christian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Function Computation and Identification over Locally Homomorphic Multiple-Access Channels</atitle><date>2024-04-22</date><risdate>2024</risdate><abstract>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.</abstract><doi>10.48550/arxiv.2404.14390</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2404.14390
ispartof
issn
language eng
recordid cdi_arxiv_primary_2404_14390
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title Function Computation and Identification over Locally Homomorphic Multiple-Access Channels
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T03%3A06%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Function%20Computation%20and%20Identification%20over%20Locally%20Homomorphic%20Multiple-Access%20Channels&rft.au=Rosenberger,%20Johannes&rft.date=2024-04-22&rft_id=info:doi/10.48550/arxiv.2404.14390&rft_dat=%3Carxiv_GOX%3E2404_14390%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true