On the Complexity of finding Stopping Distance in Tanner Graphs
<|reference_start|>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. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence<|reference_end|>
@article{krishnan2005on,
    title={On the Complexity of finding Stopping Distance in Tanner Graphs},
    author={K. Murali Krishnan, Priti Shankar},
    journal={IEEE Trans. Info. Theory, 53(6), 2007, pp. 2278-2280.},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0512101},
    primaryClass={cs.IT cs.CC math.IT}
}