Pith. sign in

REVIEW 1 cited by

A Survey on Trapping Sets and Stopping Sets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1705.05996 v1 pith:IFWHA6Y4 submitted 2017-05-17 cs.IT math.IT

classification cs.ITmath.IT
keywords setstrappingstoppingerrorcodesconstructionsldpcsurvey
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

LDPC codes are used in many applications, however, their error correcting capabilities are limited by the presence of stopping sets and trapping sets. Trapping sets and stopping sets occur when specific low-wiehgt error patterns cause a decoder to fail. Trapping sets were first discovered with investigation of the error floor of the Margulis code. Possible solutions are constructions which avoid creating trapping sets, such as progressive edge growth (PEG), or methods which remove trapping sets from existing constructions, such as graph covers. This survey examines trapping sets and stopping sets in LDPC codes over channels such as BSC, BEC and AWGNC.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs

    cs.IT 2025-06 conditional novelty 6.0 of 10

    Girth-8 regular bipartite graphs can be built with only O(sqrt(n)) check nodes, asymptotically optimal, using sequences free of three-term arithmetic progressions.

Pith tools