Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes

Details Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes

2007-04-24

arxiv.org/abs/0704.3199v1

Computer Science

Information Theory

5 pages, 2 figures, to appear in Proc. of IEEE ISIT 2007

Scientific paper

In this paper, the stability condition for low-density parity-check (LDPC) codes on the binary erasure channel (BEC) is extended to generalized LDPC (GLDPC) codes and doublygeneralized LDPC (D-GLDPC) codes. It is proved that, in both cases, the stability condition only involves the component codes with minimum distance 2. The stability condition for GLDPC codes is always expressed as an upper bound to the decoding threshold. This is not possible for D-GLDPC codes, unless all the generalized variable nodes have minimum distance at least 3. Furthermore, a condition called derivative matching is defined in the paper. This condition is sufficient for a GLDPC or DGLDPC code to achieve the stability condition with equality. If this condition is satisfied, the threshold of D-GLDPC codes (whose generalized variable nodes have all minimum distance at least 3) and GLDPC codes can be expressed in closed form.

Affiliated with

Also associated with

No associations

Rating

Generalized Stability Condition for Generalized and 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 Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-225623