Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators

Details Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators

2006-07-07

arxiv.org/abs/cs/0607024v1

Computer Science

Information Theory

8 pages, submitted to IEEE Transactions on Information Theory

Scientific paper

The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or, equivalently, the parity-check matrix representing the code. In this paper, we introduce the notion of dead-end sets to explicitly demonstrate this dependency. The choice of the parity-check matrix entails a trade-off between performance and complexity. We give bounds on the complexity of iterative decoders achieving optimal performance in terms of the sizes of the underlying parity-check matrices. Further, we fully characterize codes for which the optimal stopping set enumerator equals the weight enumerator.

Affiliated with

Also associated with

No associations

Rating

Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators 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 Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96437