LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. In this p...
David G. M. Mitchell, Ali Emre Pusane, Kamil Sh. Z...
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protographbased...
David G. M. Mitchell, Ali Emre Pusane, Norbert Goe...
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
Shadi Abu-Surra, William E. Ryan, Dariush Divsalar
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
Enrico Paolini, Marc P. C. Fossorier, Marco Chiani