On the Minimum Distance of Generalized Spatially Coupled LDPC Codes
Abstract
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 generalized 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.
Cite
@article{arxiv.1303.1858,
title = {On the Minimum Distance of Generalized Spatially Coupled LDPC Codes},
author = {David G. M. Mitchell and Michael Lentmaier and Daniel J. Costello},
journal= {arXiv preprint arXiv:1303.1858},
year = {2016}
}
Comments
Submitted to the IEEE International Symposium on Information Theory 2013