Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ISIT.2014.6874913 | Information Theory |
Keywords | Field | DocType |
Reed-Solomon codes,error correction codes,capacity link,destination node,distributed Reed-Solomon codes,distributed error correction coding scheme,full capacity region,relay node,simple multiple access networks | Concatenated error correction code,BCJR algorithm,Sequential decoding,Berlekamp–Welch algorithm,Computer science,Serial concatenated convolutional codes,Turbo code,Algorithm,Reed–Solomon error correction,Tornado code | Conference |
Volume | Citations | PageRank |
abs/1310.5187 | 8 | 0.65 |
References | Authors | |
15 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wael Halbawi | 1 | 30 | 3.00 |
| Tracey Ho | 2 | 262 | 29.78 |
| Hongyi Yao | 3 | 192 | 14.89 |
| Iwan M. Duursma | 4 | 279 | 26.85 |