On the Complexity of finding Stopping Distance in Tanner Graphs
classification
💻 cs.IT
cs.CCmath.IT
keywords
stoppingtannerdistancegraphscomplexitycomputationcomputingconsequence
read the original abstract
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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.