Elimination of Cyclic Stopping Sets for Enhanced Decoding of LDPC Codes Conference Paper

abstract

• 2018 IEEE. Ahstract- The Stopping-Set Elimination Problem is studied for LDPC codes: how to remove the fewest number of erasures from a stopping set such that the remaining erasures can be decoded by belief propagation in k iterations (including k = ). The problem is known to be NP-hard. Here efficient exact algorithms and approximation algorithms are presented for stopping sets whose induced graphs in Tanner graphs contain cycles.

name of conference

• 2018 IEEE International Symposium on Information Theory (ISIT)

authors

• Jiang, Anxiao (Andrew)

published proceedings

• 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)

author list (cited authors)

• Jiang, A. A.

citation count

• 1

complete list of authors

• Jiang, Anxiao Andrew

publication date

• June 2018

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.2018.8437701

International Standard Book Number (ISBN) 13

• 9781538647806

start page

• 821

end page

• 825

volume

• 00

URL

• http://dx.doi.org/10.1109/isit.2018.8437701