Analysis of Weight Distributions of Two-Edge type LDPC Codes by Hayman Approximation

Multi-edge type LDPC codes are introduced by Richardson and Urbanke, and they show examples of their ensembles have better performance than other known ensembles. Orlitsky et al. derived the condition for irregular LDPC code ensembles with small linear weight codewords exponentially decreasing in code length. Nakasendo et al. derived the condition in which code ensembles have exponentially decreasing small linear weight codewords for two-edge type LDPC code ensembles which is simple example of mufti-edge type LDPC code ensembles. Our conclusion is the same as that of Nakasendo et al., and although Nakasendo's method is difficult to apply to more than three edge-types, there is a possibility that our method using Hayman approximation as Di et al. do derives the condition for mufti-edge type LDPC codes ensembles.