Multi-Edge type LDPC Code Ensembles with Exponentially Pew Codewords of Linear Small Weight

摘要

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 minimum distance linearly increasing in code length. Nakasendo et al. derived the condition that code ensembles have exponentially decreasing small linear weight codewords for two-edge type LDPC code ensembles which is simple example of multi-edge type LDPC code ensembles. In this letter, we derive the condition for multi-edge type LDPC code ensembles with exponentially decreasing small linear weight codewords.