Comparison of the Probability of Reed – Solomon and LDPC Codes Decoding Error in the Gilbert – Elliott Channel

Channels with memory can be described using the Gilbert–Elliott model. To correct errors in such channels, non– binary Reed-Solomon codes are used, as well as low-density parity-check codes together with interleaving procedure or modifications of classical decoding algorithms. The purpose of this study is to compare the effectiveness of these codes when using different decoding algorithms in channels with memory. The probability of decoding error for various channel parameters was estimated using simulation modeling. The study showed that as the number of errors outside the bursts increases, the Reed-Solomon codes begin to work worse than the special decoding algorithm for LDPC codes. Thus, in channels with a non-zero probability of errors in the "good" state, it is reasonable to use low density parity check codes.