MET-LDPC Code Ensembles of Low Code Rates With Exponentially Few Small Weight Codewords

Abstract

This work studies the design of MET-LDPC code ensembles at low code rates with good threshold performances and exponentially few small weight codewords. There was a notable study on the condition, so called the 't' -value condition', for exponentially few small weight codewords. Meanwhile, it was shown that by introducing degree-one variable nodes, the threshold performances of MET-LDPC code ensembles of low rates can be significantly improved. However, the degree-one variable nodes may result in small weight codewords and thus must be carefully introduced to MET-LDPC code ensembles. Despite the importance, the existing t-value condition was developed only for MET-LDPC code ensembles without degree-one variable nodes. This work extends the t-value condition to MET-LDPC code ensembles with degree-one variable nodes, which includes the existing work as a special case. The extended t-value condition provides useful insights into the contributions of degree-one variable nodes to the distribution of small weight codewords. Thus, the results of this work allow us to design MET-LDPC code ensembles of low rates with both good threshold performances and exponentially few small weight codewords. In addition, it will be demonstrated that MET-LDPC codes at finite lengths based on the designed code ensembles have good error-rate performances both in the waterfall and low-error-rate regions.