Jointly optimized design of distributed Reed–Solomon codes by proper selection in relay

Guo, Pengcheng; Yang, Fang; Zhao, Chunli; Ullah, Waheed

doi:10.1007/s11235-021-00822-w

Cited by 9 publications

(19 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider a distributed Goppa coding scheme, Goppa code C 1 (15,11,3) and C 1 (15,7,5) are applied at source and relay, respectively. Both set L 1 and L 2 contain all non-zero elements of GF(2 4 ) using the polynomial X 4 + X + 1.…”

Section: Examples Of Two Methodsmentioning

confidence: 99%

“…2. The criterion value min(v 0 ) about determining the selection pattern under method 1 with Goppa 1 (15,11,3) and Goppa 2 (15,7,5). Tab.…”

Section: Serial Numbermentioning

confidence: 99%

“…Selection pattern u 0 u 1 1 [2,4,5,7,9,10,11,12,13,14,15,16,18,19,20,21] 0 13 2 [2,3,4,5,7,8,9,10,11,12,13,14,16,17,18,19] 0 14 3 [2,3,4,5,7,9,10,11,12,13,14,16,18,19,20,21] 0 14…”

Section: Serial Numbermentioning

confidence: 99%

“…6. BER performance comparison using different joint decoding algorithms for distributed Goppa coding scheme with Goppa 1 (15,11,3) and Goppa 2 (15,7,5). gradually fails.…”

Section: Performance Comparison On Non-ideal and Ideal Source-to-rela...mentioning

confidence: 99%

“…Combining these protocols with channel coding builds a more effective mode of cooperation, which is known as coded-cooperative. Low density parity check (LDPC) codes [7], turbo codes [8], polar codes [9] and Reed-Muller (RM) codes [10] are applied to codedcooperative schemes in the existing literature [11][12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Jointly Optimized Design of Distributed Goppa Codes and Decoding

Feng¹,

Yang²,

Chen³

et al. 2023

RADIOENGINEERING

View full text Add to dashboard Cite

In order to improve the adverse influence of fading channel in communication system, a distributed Goppa coding scheme is proposed in this paper. Two Goppa codes are set at the source node and the relay node in this scheme respectively. An optimal design criterion at the relay is proposed to obtain the optimal joint resultant code at the destination. Furthermore, two novel joint decoding algorithms are proposed to enhance the overall BER performance of the proposed scheme. Monte Carlo simulations show that the proposed distributed Goppa coding scheme outperforms the non-cooperative scheme. Moreover, the proper information selection approach at the relay performs better than random selection in the proposed distributed Goppa coding scheme.

show abstract

Section: Examples Of Two Methodsmentioning

confidence: 99%

“…2. The criterion value min(v 0 ) about determining the selection pattern under method 1 with Goppa 1 (15,11,3) and Goppa 2 (15,7,5). Tab.…”

Section: Serial Numbermentioning

confidence: 99%

“…Selection pattern u 0 u 1 1 [2,4,5,7,9,10,11,12,13,14,15,16,18,19,20,21] 0 13 2 [2,3,4,5,7,8,9,10,11,12,13,14,16,17,18,19] 0 14 3 [2,3,4,5,7,9,10,11,12,13,14,16,18,19,20,21] 0 14…”

Section: Serial Numbermentioning

confidence: 99%

“…6. BER performance comparison using different joint decoding algorithms for distributed Goppa coding scheme with Goppa 1 (15,11,3) and Goppa 2 (15,7,5). gradually fails.…”

Section: Performance Comparison On Non-ideal and Ideal Source-to-rela...mentioning

confidence: 99%