Distributed Reed-Solomon codes for simple multiple access networks

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. Arbitrary errors may be introduced by up to z of the relay nodes. We propose an efficient distributed error correction coding scheme, where the relay nodes encode independently such that the overall codewords received at the destination are codewords from a single Reed-Solomon code. We show that it achieves the full capacity region for up to three sources.