Computer Science – Information Theory
Scientific paper
2009-03-09
Computer Science
Information Theory
Revision of the journal paper. 37 pages, 2 figures. Submitted
Scientific paper
In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with check or variable node minimum distance greater than 2 are shown to be have good growth rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the latter case it is shown that the growth rate depends only on the check and variable nodes with minimum distance 2. An important connection between this new result and the stability condition of D-GLDPC codes over the BEC is highlighted. Such a connection, previously observed for LDPC and GLDPC codes, is now extended to the case of D-GLDPC codes. Finally, it is shown that the analysis may be extended to include the growth rate of the stopping set size distribution of irregular D-GLDPC codes.
Chiani Marco
Flanagan Mark F.
Fossorier Marc
Paolini Enrico
No associations
LandOfFree
On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-96043