CaltechAUTHORS
Published October 2017 | Version public
Book Section - Chapter Metadata-only

Stopping Set Elimination for LDPC Codes

Creators

  • 1. ROR icon Texas A&M University
  • 2. ROR icon Shandong University
  • 3. ROR icon California Institute of Technology

Abstract

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

Identifiers

Eprint ID
84525
Resolver ID
CaltechAUTHORS:20180125-132316726

Dates

Created
2018-01-31
Created from EPrint's datestamp field
Updated
2021-11-15
Created from EPrint's last_modified field