A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
On the minimum distance of generalized spatially coupled LDPC codes
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 underlyingdoi:10.1109/isit.2013.6620551 dblp:conf/isit/MitchellLC13 fatcat:2k5nahe4ozh3hbxdr2mv676oqq