Bounds of the probability of error for decode-and-forward relaying with two sources

We determine analytically upper and lower bounds on the probability of error for a relay network with two sources, a common destination, and one relay. The sources and the relay use binary linear codes, the relay employs the decode-and-forward strategy, and the destination uses an iterative decoder. The bounds are expressed with a union-bound approach and weight enumerators. A comparison to simulation results shows that the bounds are very accurate.