8 citations · 8 across the 2 of their papers we have counts for
1 paper · 1 filter
K. Murali Krishnan, Priti Shankar
Two 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 T…