Evaluate iterative-decoding performance of the proposed LDPC convolutional codes

Evaluate the block-error rates and bit-error rates of the proposed rate-adaptive LDPC convolutional codes under iterative decoding, including both finite-length and asymptotic decoding performance.

Background

The paper develops high-rate LDPC convolutional codes with rates of the form R=(n_0-1)/n_0 by applying periodic row elimination to parity-check matrices of cyclic codes. It characterizes the survival of length-4 cycles, studies the effect of Golomb-ruler and relaxed Golomb-ruler exponent vectors, and derives upper bounds on free distance based on pairwise column-weight sums.

Although the paper reports estimated free distances and asymptotic coding gains for representative constructions, it does not evaluate their actual decoding behavior. In particular, the authors leave the assessment of block and bit error rates under iterative decoding for future work, covering both finite-length and asymptotic regimes.