Jiang, Anxiao Andrew and Upadhyaya, Pulakesh and Wang, Ying and Narayanan, Krishna R. and Zhou, Hongchao and Sima, Jin and Bruck, Jehoshua (2017) Stopping Set Elimination for LDPC Codes. In: 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE , Piscataway, NJ, pp. 700-707. ISBN 978-1-5386-3267-3. http://resolver.caltech.edu/CaltechAUTHORS:20180125-132316726
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20180125-132316726
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.
| Item Type: | Book Section | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| Additional Information: | © 2017 IEEE. Date Added to IEEE Xplore: 18 January 2018. | |||||||||
| Record Number: | CaltechAUTHORS:20180125-132316726 | |||||||||
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:20180125-132316726 | |||||||||
| Official Citation: | A. A. Jiang et al., "Stopping set elimination for LDPC codes," 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 2017, pp. 700-707. doi: 10.1109/ALLERTON.2017.8262806 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 84525 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | Ruth Sustaita | |||||||||
| Deposited On: | 31 Jan 2018 18:58 | |||||||||
| Last Modified: | 31 Jan 2018 18:58 |
Repository Staff Only: item control page
