On the Complexity of finding Stopping Distance in Tanner Graphs

Details On the Complexity of finding Stopping Distance in Tanner Graphs On the Complexity of finding Stopping Distance in Tanner Graphs

2005-12-28

arxiv.org/abs/cs/0512101v2

IEEE Trans. Info. Theory, 53(6), 2007, pp. 2278-2280.

Computer Science

Information Theory

A decision problem proved NP-complete in the earlier version was not equivalent to stopping distance problem for Tanner graphs

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

On the Complexity of finding Stopping Distance in Tanner Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of finding Stopping Distance in Tanner Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of finding Stopping Distance in Tanner Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-668961