Abstract--An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavio...
Michael Lentmaier, Arvind Sridharan, Daniel J. Cos...
— It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linear...
David G. M. Mitchell, Michael Lentmaier, Daniel J....
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...
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,...
Abstract Braided convolutional codes (BCCs) form a class of iteratively decodable convolutional codes that are constructed from component convolutional codes. In braided code divis...
Michael Lentmaier, Marcos B. S. Tavares, Gerhard F...