Abstract
For a (lambda(x); rho(x)) standard irregular LDPC code ensemble, the growth rate of the average weight distribution for small relative weight omega is given by log(lambda'(0)rho'(1))omega + O(omega <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) in the limit of code length n. If lambda'(0)rho'(1) < 1, there exist exponentially few code words of small linear weight, as n tends to infinity. It is known that the condition coincides with the stability condition of density evolution over the erasure channels with the erasure probability 1. In this paper, we show that this is also the case with multi-edge type LDPC (MET-LDPC) codes. MET-LDPC codes are generalized structured LDPC codes introduced by Richardson and Urbanke. The parameter corresponding lambda'(0)rho'(1) appearing in the conditions for MET-LDPC codes is given by the spectral radius of the matrix defined by extended degree distributions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
