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.
|Title of host publication||[Host publication title missing]|
|Publisher||IEEE--Institute of Electrical and Electronics Engineers Inc.|
|State||Published - 2011|
|Event||IEEE International Symposium on Information Theory, 2011 - Saint Petersburg, Russian Federation|
|Conference||IEEE International Symposium on Information Theory, 2011|
|Period||2011/07/31 → 2011/08/05|