On the minimum distance of generalized spatially coupled LDPC codes

David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello
2013 2013 IEEE International Symposium on Information Theory  
Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the maximum a-posteriori (MAP) decoding threshold of the underlying
more » ... ralized LDPC block code ensemble. Here we show that, in addition to their excellent iterative decoding thresholds, ensembles of GSC-LDPC codes are asymptotically good and have large minimum distance growth rates.
doi:10.1109/isit.2013.6620551 dblp:conf/isit/MitchellLC13 fatcat:2k5nahe4ozh3hbxdr2mv676oqq