Nearby in the stack

On the Complexity of finding Stopping Distance in Tanner Graphs · arXivDesk

cs/0512101Dec 28, 2005A decision problem proved NP-complete in the earlier version was not equivalent to stopping distance problem for Tanner graphs. Now corrected

On the Complexity of finding Stopping Distance in Tanner Graphs

K. Murali Krishnan, Priti Shankar

Information Theory Computational Complexity

arXiv PDF

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

Briefing

What this paper is actually doing

This is a heuristic sketch from the abstract. Sign in for a live briefing.

GraduateNovelty 3/5

Researchers working in cs.IT and adjacent areas.

Claims

The paper addresses: 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.

Methods

Method details are not extracted without an AI key — open the PDF or HTML version.
Author comment: A decision problem proved NP-complete in the earlier version was not equivalent to stopping distance problem for Tanner graphs. Now corrected

Limitations

This is a heuristic briefing generated without a language model. Treat it as a sketch, not an analysis.

Why it matters

Newly listed under cs.IT. Connect your OpenRouter key to unlock a full arXivDesk briefing.

Open questions

What is the strongest empirical result, and on which baseline?
Which assumption would most change the conclusion if it failed?

Socratic margin

Ask the abstract

Questions are grounded in the title and abstract. If the PDF is required, arXivDesk will say so.

Nearby in the stack

arXiv did not return neighbours for this paper. Try again in a bit.