Distributed Reed-Solomon Codes for Simple Multiple Access Networks

Distributed Reed-Solomon Codes for Simple Multiple Access Networks

We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Halbawi, Wael, Ho, Tracey, Yao, Hongyi, Duursma, Iwan
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 Halbawi, Wael
Ho, Tracey
Yao, Hongyi
Duursma, Iwan
description We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes are adversarial. We propose a computationally efficient distributed coding scheme and show that it achieves the full capacity region for up to three sources. Specifically, the relay nodes encode in a distributed fashion such that the overall codewords received at the destination are codewords from a single Reed-Solomon code.
doi_str_mv 10.48550/arxiv.1310.5187
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1310_5187</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1310_5187</sourcerecordid><originalsourceid>FETCH-LOGICAL-a657-36f3b1c59537028ebb7dfe3e120f7c3666516c206cb074713f2604fda7f31c3f3</originalsourceid><addsrcrecordid>eNotzztPwzAUBWAvDKiwMyH_gRQ7N7bTsYSnVEBqu0d-3CtZJLiyUx7_HgJM5-gMR_oYu5Bi2bRKiSubP-P7UsLPoGRrTtn1TSxTju44YeBbxFDt0pDG9Ma7FLBwSpnv4ngYkD8dhynOZe09lsKfcfpI-bWcsROyQ8Hz_1yw_d3tvnuoNi_3j916U1mtTAWawEmvVgqMqFt0zgRCQFkLMh601kpqXwvtnTCNkUC1Fg0FawikB4IFu_y7_TX0hxxHm7_62dLPFvgGCpFDhQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Distributed Reed-Solomon Codes for Simple Multiple Access Networks</title><source>arXiv.org</source><creator>Halbawi, Wael ; Ho, Tracey ; Yao, Hongyi ; Duursma, Iwan</creator><creatorcontrib>Halbawi, Wael ; Ho, Tracey ; Yao, Hongyi ; Duursma, Iwan</creatorcontrib><description>We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes are adversarial. We propose a computationally efficient distributed coding scheme and show that it achieves the full capacity region for up to three sources. Specifically, the relay nodes encode in a distributed fashion such that the overall codewords received at the destination are codewords from a single Reed-Solomon code.</description><identifier>DOI: 10.48550/arxiv.1310.5187</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2013-10</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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1310.5187$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1310.5187$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Halbawi, Wael</creatorcontrib><creatorcontrib>Ho, Tracey</creatorcontrib><creatorcontrib>Yao, Hongyi</creatorcontrib><creatorcontrib>Duursma, Iwan</creatorcontrib><title>Distributed Reed-Solomon Codes for Simple Multiple Access Networks</title><description>We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes are adversarial. We propose a computationally efficient distributed coding scheme and show that it achieves the full capacity region for up to three sources. Specifically, the relay nodes encode in a distributed fashion such that the overall codewords received at the destination are codewords from a single Reed-Solomon code.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzztPwzAUBWAvDKiwMyH_gRQ7N7bTsYSnVEBqu0d-3CtZJLiyUx7_HgJM5-gMR_oYu5Bi2bRKiSubP-P7UsLPoGRrTtn1TSxTju44YeBbxFDt0pDG9Ma7FLBwSpnv4ngYkD8dhynOZe09lsKfcfpI-bWcsROyQ8Hz_1yw_d3tvnuoNi_3j916U1mtTAWawEmvVgqMqFt0zgRCQFkLMh601kpqXwvtnTCNkUC1Fg0FawikB4IFu_y7_TX0hxxHm7_62dLPFvgGCpFDhQ</recordid><startdate>20131018</startdate><enddate>20131018</enddate><creator>Halbawi, Wael</creator><creator>Ho, Tracey</creator><creator>Yao, Hongyi</creator><creator>Duursma, Iwan</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20131018</creationdate><title>Distributed Reed-Solomon Codes for Simple Multiple Access Networks</title><author>Halbawi, Wael ; Ho, Tracey ; Yao, Hongyi ; Duursma, Iwan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a657-36f3b1c59537028ebb7dfe3e120f7c3666516c206cb074713f2604fda7f31c3f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Halbawi, Wael</creatorcontrib><creatorcontrib>Ho, Tracey</creatorcontrib><creatorcontrib>Yao, Hongyi</creatorcontrib><creatorcontrib>Duursma, Iwan</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>Halbawi, Wael</au><au>Ho, Tracey</au><au>Yao, Hongyi</au><au>Duursma, Iwan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Distributed Reed-Solomon Codes for Simple Multiple Access Networks</atitle><date>2013-10-18</date><risdate>2013</risdate><abstract>We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes are adversarial. We propose a computationally efficient distributed coding scheme and show that it achieves the full capacity region for up to three sources. Specifically, the relay nodes encode in a distributed fashion such that the overall codewords received at the destination are codewords from a single Reed-Solomon code.</abstract><doi>10.48550/arxiv.1310.5187</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1310.5187
ispartof
issn
language eng
recordid cdi_arxiv_primary_1310_5187
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title Distributed Reed-Solomon Codes for Simple Multiple Access Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T16%3A02%3A16IST&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=Distributed%20Reed-Solomon%20Codes%20for%20Simple%20Multiple%20Access%20Networks&rft.au=Halbawi,%20Wael&rft.date=2013-10-18&rft_id=info:doi/10.48550/arxiv.1310.5187&rft_dat=%3Carxiv_GOX%3E1310_5187%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