Evaluation and design of irregular LDPC codes using ACE spectrum
IEEE Transactions on Communications
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices
IEEE Transactions on Information Theory
Stopping set distributions of algebraic geometry codes from elliptic curves
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 754.90 |
Two decision problems related to the computation f stopping sets in Tanner graphs are shown to be NP-complete. It follows as a consequence that there exists no polynomial time algorithm for computing the stopping distance of a Tanner graph unless P = NP.