Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes

David G. M. Mitchell, Ali E. Pusane, Michael Lentmaier +1

Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with…