We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.

In this paper, powerful induced-cyclic totally decomposed cumulative Goppa (TDCG) codes are selected and used for coded-cooperative diversity, which can fit wireless communication applications. Two TDCG codes employed at the source and relay nodes establish the joint design of the destination channel code. In the cooperation phase, we consider an optimized relay channel code which improves the overall bit-error-rate (BER) performance. Two methods of optimization are explored. The most practical method for optimization in terms of reduced processing complexity is proposed. We use a joint decoding which exploits all the resources gained by the cooperation scheme at the destination. The BER performance is evaluated through Monte-Carlo simulations with BPSK modulation and coherent detection over the flat Rayleigh fading channel. The proposed TDCG coded-cooperative diversity scheme exhibit a better BER performance than the non-cooperation scheme and other existing coded cooperation methods of similar code rates under similar channel conditions.

The distributed Goppa coded spatial modulation (DGC‐SM) scheme is proposed in cooperative scenarios. In the proposed DGC‐SM scheme, the relay chooses the partial information from the source by using the idea of information selection, and then re‐encodes the selected information. At the destination, a distributed Goppa code is obtained corresponding to each selection. In order to get the best possible code, an optimal information selection algorithm is proposed at the relay. In the proposed optimal algorithm, all selections and source message sequences are considered, which results in high complexity. Thus, another optimized information selection algorithm with low complexity is proposed at the relay. To further enhance the capability to get the source information, two efficient joint decoding algorithms called smart decoding algorithm and improved smart decoding algorithm are proposed. Moreover, the bit error rate (BER) performance bound of the proposed DGC‐SM scheme is derived. Through the simulations, the effectiveness of the proposed two optimized information selection algorithms is confirmed. Also, it is observed that the simulation and analytical results closely match at high signal‐to‐noise ratio (SNR).