Stopping set elimination for LDPC codes Conference Paper uri icon

abstract

  • 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.

name of conference

  • 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

published proceedings

  • 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

author list (cited authors)

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

citation count

  • 2

complete list of authors

  • Jiang, Anxiao Andrew||Upadhyaya, Pulakesh||Wang, Ying||Narayanan, Krishna R||Zhou, Hongchao||Sima, Jin||Bruck, Jehoshua

publication date

  • October 2017

publisher