On the Complexity of finding Stopping Distance in Tanner Graphs
  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 Tanner graph follows as a consequence 
K. Murali Krishnan, Priti Shankar