Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 2017 | public
Book Section - Chapter

Stopping Set Elimination for LDPC Codes


This work studies the Stopping-Set Elimination Problem, namely, given a stopping set, how to remove the fewest erasures so that the remaining erasures can be decoded by belief propagation in k iterations (including k =∞). The NP-hardness of the problem is proven. An approximation algorithm is presented for k = 1. And efficient exact algorithms are presented for general k when the stopping sets form trees.

Additional Information

© 2017 IEEE. Date Added to IEEE Xplore: 18 January 2018.

Additional details

August 19, 2023
October 18, 2023