Corpus ID: 16073828

On the Complexity of finding Stopping Distance in Tanner Graphs

  title={On the Complexity of finding Stopping Distance in Tanner Graphs},
  author={K. M. Krishnan and P. Shankar},
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 
Bounds on the Expansion Properties of Tanner Graphs
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
Finding All Small Error-Prone Substructures in LDPC Codes
A construction of LDPC codes with low error floors
Exhausting Error-Prone Patterns in LDPC Codes
A new Algorithm to construct LDPC codes with large stopping sets
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
On the Exhaustion and Elimination of Trapping Sets: Algorithms & The Suppressing Effect
  • Chih-Chun Wang
  • Mathematics, Computer Science
  • 2007 IEEE International Symposium on Information Theory
  • 2007
On the Optimized Patent-Free LDPC Code Design for Content Distribution Systems


The intractability of computing the minimum distance of a code
  • A. Vardy
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1997
On the inherent intractability of certain coding problems (Corresp.)
Stopping sets and the girth of Tanner graphs
Improved Upper Bounds on Stopping Redundancy
On the stopping distance and the stopping redundancy of codes
Construction of irregular LDPC codes with low error floors
Construction of short block length irregular low-density parity-check codes
  • A. Ramamoorthy, R. Wesel
  • Mathematics, Computer Science
  • 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)
  • 2004
Finite-length analysis of low-density parity-check codes on the binary erasure channel
Stopping set distribution of LDPC code ensembles
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
  • STOC
  • 1971