2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/165295Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequenceA decision problem proved NP-complete in the earlier version was not equivalent to stopping distance problem for Tanner graphs. Now correctedInformation TheoryComputational Complexitytext