Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
D. K. Zigangirov, Kamil Sh. Zigangirov · Problems of Information Transmission · 2006
A lower bound for the number of iteratively correctable erasures is given, with application to the ensemble of LDPC codes with parity-check matrices composed of permutation matrices [1]. We assume that the Zyablov-Pinsker iterative decoding algorithm [2] is used. Its complexity is O ( N log N ), where N is the block length.