2013/10/19 by Wael Halbawi, Halbawi, Wael, Tracey Ho +5
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1310.5187
12 pages, 1 figure
arxiv created 2013/10/19 · openalex publication_date 2013/10/19 · arxiv updated 2013/10/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.