@inproceedings{57386ea7f7094be38856a34f52a09e2e,
title = "Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes",
abstract = "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 the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bound is compared to a lower bound and evaluated numerically. It is found that, for a sufficiently large period, the bounds coincide. This approach is then extended to obtain bounds on the trapping set numbers, which define the size of the smallest, non-empty trapping sets, for these asymptotically good, periodically time-varying LDPCC code ensembles.",
keywords = "spatial coupling, LDPC codes, LDPC convolutional codes, trapping sets",
author = "Mitchell, {David G.M.} and Pusane, {Ali Emre} and Michael Lentmaier and {Costello Jr.}, {Daniel J.}",
year = "2011",
doi = "10.1109/ISIT.2011.6033700",
language = "English",
isbn = "978-1-4577-0596-0",
publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",
pages = "1096--1100",
booktitle = "2011 IEEE International Symposium on Information Theory Proceedings",
address = "United States",
note = "IEEE International Symposium on Information Theory, 2011, ISIT07 ; Conference date: 31-07-2011 Through 05-08-2011",
}