@inproceedings{59227d8ea0fe43ac966f98240187a4db,
title = "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.",
keywords = "LDPC codes, generalized LDPC codes, GLDPC codes, GLDPC convolutional codes, spatial coupling",
author = "Mitchell, {David G.M.} and Michael Lentmaier and {Costello Jr.}, {Daniel J.}",
year = "2013",
doi = "10.1109/ISIT.2013.6620551",
language = "English",
isbn = "9781479904440",
publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",
pages = "1874--1878",
booktitle = "IEEE International Symposium on Information Theory Proceedings (ISIT), 2013",
address = "United States",
note = "IEEE International Symposium on Information Theory, 2013, ISIT13 ; Conference date: 07-07-2013 Through 12-07-2013",
}