On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes

Simple item page
dc.creatorMcGregor, Andrew
dc.creatorMilenkovic, Olgica
dc.date2007-04-18
dc.date2008-08-03
dc.date.accessioned2026-07-07T09:54:05Z
dc.date.available2026-07-07T09:54:05Z
dc.descriptionWe prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) codes, is NP-hard. The ramifications of our findings are that methods used for estimating the height of the error-floor of moderate- and long-length LDPC codes based on stopping and trapping set enumeration cannot provide accurate worst-case performance predictions.
dc.description16 pages, 6 figure, submitted journal version
dc.identifierhttps://arxiv.org/abs/0704.2258
dc.identifierhttp://arxiv.org/abs/0704.2258
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166185
dc.subjectInformation Theory
dc.titleOn the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
dc.typetext

Files

Collections

arXiv