On the Complexity of finding Stopping Distance in Tanner Graphs
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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
A decision problem proved NP-complete in the earlier version was not equivalent to stopping distance problem for Tanner graphs. Now corrected
A decision problem proved NP-complete in the earlier version was not equivalent to stopping distance problem for Tanner graphs. Now corrected