Approaching Capacity with Asymptotically Regular LDPC Codes
We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increa
