Modification Methods for Construction and Performance Analysis of Low-Density Parity-Check Codes over the Markov-Modulated Channels
Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa · 2004
We derive burst error correctable length of the lowdensity parity-check (LDPC) codes by the iterative decoding algorithms. By results of simulation, we show that the decoding performance of iterative decoding algorithms for the LDPC codes over the Markovmodulated binary symmetric channels (MM-BSC) are aected by the distance between elements (DBE). We also show that some column permuted LDPC codes that have larger DBE, have robustness in error performance over the MM-BSC, compared to the original LDPC codes.