Stopping Set Elimination for LDPC Codes Conference Paper uri icon


  • © 2017 IEEE. 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.

author list (cited authors)

  • Jiang, A., Upadhyaya, P., Wang, Y., Narayanan, K. R., Zhou, H., Sima, J., & Bruck, J.

citation count

  • 2

publication date

  • October 2017