On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes

Simple item page
dc.creatorFlanagan, Mark F.
dc.creatorPaolini, Enrico
dc.creatorChiani, Marco
dc.creatorFossorier, Marc
dc.date2008-08-26
dc.date.accessioned2026-07-07T09:58:28Z
dc.date.available2026-07-07T09:58:28Z
dc.descriptionIn 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. Assuming that there exist check and variable nodes with minimum distance 2, it is shown that the growth rate depends only on these nodes. 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.
dc.description10 pages, 1 figure, presented at the 46th Annual Allerton Conference on Communication, Control and Computing (this version includes additional appendix)
dc.identifierhttps://arxiv.org/abs/0808.3504
dc.identifierhttp://arxiv.org/abs/0808.3504
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167729
dc.subjectInformation Theory
dc.titleOn the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes
dc.typetext

Files

Collections

arXiv