Stopping set elimination for LDPC codes

descriptionPublicationkeyboard_double_arrow_right Article , Conference object , Part of book or chapter of book 01 Oct 2017 United States Publisher:IEEEJournal:2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Authors: Anxiao Andrew Jiang; Pulakesh Upadhyaya; Ying Wang; Krishna R. Narayanan; Hongchao Zhou; Jin Sima; Jehoshua Bruck;

doi: 10.1109/allerton.2017.8262806

Stopping set elimination for LDPC codes

- Summary
- Subjects
- Metrics

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.

Country

United States

Related Organizations

Shandong Women’s University
China (People's Republic of)
California Institute of Technology
United States
The University of Texas System
United States
Texas A&M University
United States

Keywords

000, 004

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average