Doubly-Generalized LDPC Codes: Stability Bound over the BEC

Details Doubly-Generalized LDPC Codes: Stability Bound over the BEC Doubly-Generalized LDPC Codes: Stability Bound over the BEC

2008-02-06

arxiv.org/abs/0802.0823v1

IEEE Trans. Inform. Theory, vol. 55, no. 3, pp. 1027-1046, March 2009

Computer Science

Information Theory

Submitted to IEEE Trans. on Inform. Theory

Scientific paper

10.1109/TIT.2008.2011446

The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of the stability condition, and is here referred to as stability bound. In this paper, a stability bound over the BEC is developed for doubly-generalized LDPC codes, where the variable and the check nodes can be generic linear block codes, assuming maximum a posteriori erasure correction at each node. It is proved that in this generalized context as well the bound depends only on the variable and check component codes with minimum distance 2. A condition is also developed, namely the derivative matching condition, under which the bound is achieved with equality.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560183